ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
ACM Transactions on Information Systems (TOIS)
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Information retrieval
Information retrieval
Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
S-tree: a dynamic balanced signature index for office retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Comparison of signature file models with superimposed coding
Information Processing Letters
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Improved methods for signature-tree construction
The Computer Journal
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Signature files and signature trees
Information Processing Letters
Signature-based structures for objects with set-valued attributes
Information Systems - Databases: Creation, management and utilization
Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases
Proceedings of the Tenth International Conference on Data Engineering
| Hi-index | 0.00 |
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different approaches for organizing signature files have been proposed, such as sequential signature files, bit-slice files, S-trees, and its different variants, as well as signature trees. In this paper, we extends the structure of signature trees by introducing multiple-bit checkings. That is, during the searching of a signature tree against a query signature sq, more than one bit in sq will be checked each time when a node is encoun tered. This does not only reduce significantly the size of a signature tree, but also increases the filtering ability of the signature tree. We call such a structure a general signature tree. Experiments have been made, showing that the general signature tree uniformly outperforms the signature tree approach.