The Community for Technology Leaders
Green Image
Issue No. 07 - July (1991 vol. 17)
ISSN: 0098-5589
pp: 678-691
ABSTRACT
<p>Trie hashing (TH), a primary key access method for storing and accessing records of dynamic files, is discussed. The key address is computed through a trie. A key search usually requires only one disk access when the trie is in core and two disk accesses for very large files when the trie must be on disk. A refinement to trie hashing, trie hashing with controlled load (THCL), is presented. It is designed to control the load factor of a TH file as tightly as that of a B-tree file, allows high load factor of up to 100% for ordered insertions, and increases the load factor for random insertions from 70% to over 85%. It is shown that these properties make trie hashing preferable to a B-tree.</p>
INDEX TERMS
primary key access method; dynamic files; key search; disk access; trie hashing; controlled load; THCL; load factor; TH file; B-tree file; high load factor; ordered insertions; load factor; random insertions; file organisation; information retrieval systems; trees (mathematics)
CITATION
W.A. Litwin, G. Levy, N. Roussopoulos, W. Hong, "Trie Hashing with Controlled Load", IEEE Transactions on Software Engineering, vol. 17, no. , pp. 678-691, July 1991, doi:10.1109/32.83904
97 ms
(Ver 3.3 (11022016))