ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
A clause indexing system for PROLOG based on superimposed coding
Australian Computer Journal
A superimposed codeword indexing scheme for very large Prolog databases
Proceedings on Third international conference on logic programming
The array model: a conceptual modeling approach to document retrieval
Journal of the American Society for Information Science
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)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Signature files: design and performance comparison of some signature extraction methods
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
On extending the functions of a relational database system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
A new parallel signature file method for efficient information retrieval
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
In order to improve the two-level signature file method designed by Sacks-Davis et al. [20], we propose new multikey access methods based on term discrimination and signature clustering. By term discrimination, we create separate, efficient access methods for the terms frequently used in user queries. We in addition cluster similar signatures by means of these terms so that we may achieve good performance on retrieval. Meanwhile we provide the space-time analysis of the proposed methods and compare them with the two-level signature file method. We show that the proposed methods achieve 15-30% savings in retrieval time and require 3-9 % more storage overhead.