Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1975 | 10.1145/320455.320469 | ACM Transactions on Database Systems |
Keywords | DocType | Volume |
hash coding,searching,new class,associated retrieval algorithm,k-letter word,retrieval,analysis,PMF design,partial match retrieval,associative retrieval,trie search algorithm,partial match,good worst-case performance,worst-case performance,partial match file design,trie algorithm,algorithms,file design,trie search | Conference | 1 |
Issue | Citations | PageRank |
2 | 21 | 27.64 |
References | Authors | |
5 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. A. Burkhard | 1 | 275 | 122.57 |