ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
ACM Transactions on Information Systems (TOIS)
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)
Compressed multi-framed signature files: an index structure for fast information retrieval
Proceedings of the 1999 ACM symposium on Applied computing
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Efficient Signature File Methods for Text Retrieval
IEEE Transactions on Knowledge and Data Engineering
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 SD-tree construction for optimal signature operations
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A hybrid index structure for set-valued attributes using itemset tree and inverted list
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
A comparative study of signature based indexes for efficient retrieval of temporal patterns
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Efficient bitmap-based indexing of time-based interval sequences
Information Sciences: an International Journal
| 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. In addition, the average time complexity of searching a signature tree is analyzed and how to maintain a signature tree on disk is discussed. We also conducted experiments, which show that the approach of signature trees provides a promising index structure.