Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
Description and performance analysis of signature file methods for office filing
ACM Transactions on Information Systems (TOIS)
Multikey access methods based on superimposed coding techniques
ACM Transactions on Database Systems (TODS)
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Optimal weight assignment for signature generation
ACM Transactions on Database Systems (TODS)
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using hashing and descriptors
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
A second look at bloom filters
Communications of the ACM
A Word-Parallel, Bit-Serial Signature Processor for Superimposed Coding
Proceedings of the Second International Conference on Data Engineering
On the File Design Problem for Partial Match Retrieval
IEEE Transactions on Software Engineering
| Hi-index | 0.98 |
Signature file has been shown to be a fairly good filtering mechanism to reduce the amount of data that need to be retrieved for a query. Previous work in signature construction has emphasized on determining the optimal signature weight to minimize the false drop probability. In this paper, we present a method to determine the optimal signature size to a block according to its bit probability and the number of objects in that block. The scheme is optimal for both uniform and nonuniform block accessing frequencies.