Description and performance analysis of signature file methods for office filing
ACM Transactions on Information Systems (TOIS)
Partitioned signature files: design issues and performance evaluation
ACM Transactions on Information Systems (TOIS)
A dynamic signature technique for multimedia databases
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Frame-sliced partitioned parallel signature files
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
A Partitioned Signature File Structure for Multiattribute and Text Retrieval
Proceedings of the Sixth International Conference on Data Engineering
Key-based partitioned bit-sliced signature file
ACM SIGIR Forum
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Hamming Filters: A Dynamic Signature File Organization for Parallel Stores
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Inverted files for text search engines
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We show that performance of some basic methods for the partitioning of signature files, namely Quick Filter and Fixed Prefix, can be easily evaluated by means of a closed formula. The approximation is based on well-known results from probability theory, and, as shown by simulations, introduces no appreciable errors when compared with the exact, cumbersome formulas used so far. Furthermore, we prove that the exact formulas for the two methods coincide. Although this does not imply that the two methods behave in the same way, it sheds light on the way they could be compared.