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
Text algorithms
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-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
A new tree inclusion algorithm
Information Processing Letters
On the top-down tree inclusion
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
On the SD-tree construction for optimal signature operations
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Expert Systems with Applications: An International Journal
Efficient answering of set containment queries for skewed item distributions
Proceedings of the 14th International Conference on Extending Database Technology
| Hi-index | 0.00 |
Advanced database application areas, such as computer aided design, office automation, digital libraries, data-mining as well as hypertext and multimedia systems need to handle complex data structures with set-valued attributes, which can be represented as bit strings, called signatures. A set of signatures can be stored in a file, called a signature file. In this paper, we propose a new method to organize a signature file into a tree structure, called a signature tree, to speed up the signature file scanning and query evaluation.