The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Multidimensional binary search trees used for associative searching
Communications of the ACM
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Associative searching in multiple storage units
ACM Transactions on Database Systems (TODS)
Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
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)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
Parallel searching for binary Cartesian product files
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
A dynamic clustering technique for physical database design
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
Associative retrieval trie hash-coding (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Orthogonal range retrieval using bucket address hashing
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
| Hi-index | 0.00 |
File designs suitable for retrieval from a file of k-letter words when queries may be only partially specified are examined. A new class of partial match file designs (called PMF designs) based upon hash coding and trie search algorithms which provide good worst-case performance is introduced. Upper bounds on the worst-case performance of these designs are given along with examples of files achieving the bound. Other instances of PMF designs are known to have better worst-case performances. The implementation of the file designs with associated retrieval algorithms is considered. The amount of storage required is essentially that required of the records themselves.