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)
Signature-based text retrieval methods: a survey
Data Engineering
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
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
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Efficient Signature File Methods for Text Retrieval
IEEE Transactions on Knowledge and Data Engineering
Accessing data cubes along complex dimensions
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
Hi-index | 0.00 |
Complex queries with multiple conjunctive (AND) predicates have attracted increasing attention for their importance in OLAP systems. Signature index is ideal for fast execution of queries involving multiple conjunctive predicates. However, previous signature-based methods did not separate the signatures from different attributes.We developed a signature augmented access index, MG-tree. It's main features are: (1) it is a light-weight search tree for indexing multiple attributes of text data, (2) it eliminates the mix of signatures from different attributes, so the construction and maintenance of the index is easy and search is efficient.Our analysis and experiments show that the MG-tree achieved a significant improvement in terms of access speed and storage space overhead over both tree-like indexes and previous multi-dimensional signature indexes, and is easier to build and maintain. MG-tree can be employed in practical DBMS implementations.