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
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
A formal system for information retrieval from files
Communications of the ACM
Communications of the ACM
Software implementation of a new method of combinatorial hashing.
Software implementation of a new method of combinatorial hashing.
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Data base designs for retrieval from a file of k-letter records when queries may be only partially specified are examined. A family of data base designs referred to as the H &agr;&bgr;&kgr; PMF-trie designs which yield a data structure with good worst case and average case performances and requires an amount of storage space essentially equal to that required of the records themselves is introduced. The analysis of the designs including bounds on the worst case performance and an explicit expression for the average performance is presented. Previously known families of PMF-trie designs are seen to be special cases within the H &agr;&bgr;&kgr; family.