ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Multikey access methods based on superimposed coding techniques
ACM Transactions on Database Systems (TODS)
Predictive test compression by hashing
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Algorithms for string searching
ACM SIGIR Forum
Performance and Architectural Issues for String Matching
IEEE Transactions on Computers
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
A new character-based indexing method using frequency data for Japanese documents
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
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
Recursive hashing functions for n-grams
ACM Transactions on Information Systems (TOIS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Detection of combined occurrences
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
On Harrison's substring testing technique
Communications of the ACM
An information-theoretic approach to text searching in direct access systems
Communications of the ACM
Unstructured data bases or very efficient text searching
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Methods for the administration of textual data in database systems
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
An associative file store using fragments for run-time indexing and compression
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Fast pattern matching for entropy bounded text
DCC '95 Proceedings of the Conference on Data Compression
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Foundations and Trends in Databases
Recent developments in the theory of data structures
Computer Languages
| Hi-index | 48.28 |
In a paper in the November 1970 Communications of the ACM, V.Y. Lum introduced a technique of file indexing named combined indices. This technique permitted decreased retrieval time at the cost of increased storage space. This paper examines combined indices under conditions of file usage with different fractions of retrieval and update. Tradeoff curves are developed to show minimal cost of file usage by grouping various partially combined indices.