ACM Transactions on Database Systems (TODS)
Analysis of a heuristic for full trie minimization
ACM Transactions on Database Systems (TODS)
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)
Design of a balanced multiple-valued file-organization scheme with the least redundancy
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Performance evaluation of attribute-based tree organization
ACM Transactions on Database Systems (TODS)
Generation and search of clustered files
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
A clustering algorithm for hierarchical structures
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Deletion in two-dimensional quad trees
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
The choice of reference points in best-match file searching
Communications of the ACM
An encoding method for multifield sorting and indexing
Communications of the ACM
Simulation of user judgments in bibliographic retrieval systems
SIGIR '81 Proceedings of the 4th annual international ACM SIGIR conference on Information storage and retrieval: theoretical issues in information retrieval
File organizations & incrementally specified queries
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Inverted files for text search engines
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
File structures and algorithms for multikey searching allow more than a single key to be used in locating a record for use in retrieval or update. Such algorithms are of use in many different kinds of information systems, including database systems, information retrieval systems, and pattern recognition and image processing systems. Such algorithms have received increased attention in recent years. However, they are not as well understood as those which handle single keys.Multikey algorithms are more difficult to evaluate than those based on the use of single keys. There are simply more factors to be considered. The evaluations performed for such algorithms should allow comparisons in order to be useful to a community of researchers and users. Theoretical analyses should be based on reasonable and clearly stated assumptions. Experiments should be repeatable and statistically valid whether they are based on "real" data or on randomly generated data.