ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
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
Massive parallelism on the hybrid text-retrieval machine
Information Processing and Management: an International Journal
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
Self-indexing inverted files for fast text retrieval
ACM Transactions on Information Systems (TOIS)
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
Analysis and performance of inverted data base structures
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Atlas: A Nested Relational Database System for Text Applications
IEEE Transactions on Knowledge and Data Engineering
Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases
Proceedings of the Tenth International Conference on Data Engineering
Using Signature Files for Querying Time-Series Data
PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
Signature file hierarchies and signature graphs: a new index method for object-oriented databases
Proceedings of the 2004 ACM symposium on Applied computing
On the cost of searching signature trees
Information Processing Letters
On the SD-tree construction for optimal signature operations
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
On the general signature trees
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
New approach for speeding-up technique of the retrieval using dynamic full-text search algorithm
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
| Hi-index | 0.89 |
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. However, it suffers from inefficiency in query processing due to the fact that for each query processed the entire signature file needs to be scanned. In this paper, we introduce a tree structure, called a signature tree, established over a signature file, which can be used to expedite the signature file scanning by one order of magnitude or more.