This Article 
 Bibliographic References 
 Add to: 
Trie Hashing with Controlled Load
July 1991 (vol. 17 no. 7)
pp. 678-691

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.

[1] R. Bayer and E. McCreight, "Organization and maintenance of large ordered indexes,"Acta Informatica, vol. 1, no. 3, pp. 173-189, 1972.
[2] R. Bayer and K. Unterauer, "Prefix B-Trees,"ACM TODS, vol. 2, no. 1, pp. 11-26, Mar. 1977.
[3] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[4] C. J. Date,An Introduction to Relational Database Systems, 4th ed. Reading, MA: Addison-Wesley, 1990, p. 854.
[5] L. Delafosse, "Improving the load factor of trie hashing," unpublished memo. (in French) Dec. 1984, p. 16.
[6] R. J. Enbody and H. C. Du, "Dynamic hashing systems,"ACM Computing Surveys, vol. 20, no. 2, June 1988.
[7] E. Fredkin, "Trie memory,"CACM, vol. 3, pp. 490-499.
[8] G. H. Gonnet,Handbook of Algorithms and Data Structures. Reading, MA: Addison-Wesley, 1984.
[9] P. Jacquet and M. Regnier, "New results on the size of the trie,"IEEE Trans. Informat. Theory(to be published).
[10] D. E. Knuth,The Art of Computer Programming. Reading, MA: Addison-Wesley, 1973.
[11] R. Krishnamurty and S. P. Morgan, "Query processing on personal computers--A pragmatic approach,"VLDB-84, Singapore, Aug. 1984, pp. 26-29.
[12] W. Litwin, "Trie hashing,"SIGMOD'81, ACM, pp. 19-29, May 1981.
[13] W. Litwin, "Data access methods and structures to enhance performance,"Database performance, State of the Art Report 12, vol. 4. New York: Pergamon, 1984, pp. 93-108.
[14] W. Litwin, "Trie hashing: Further properties and performances" presented at theInt. Conf. on Foundation of Data Organization, Kyoto, Japan, May 1985.
[15] W. Litwin and D. Lomet, "Bounded disorder access method," presented at the2nd Int. Conf on Data Eng., Los Angeles, CA, Feb. 1986.
[16] W. Litwin, D. Zegour, and G. Levy, "Multilevel trie hashing," inExtending Database Technology. New York: Springer-Verlag, Mar. 1988.
[17] D. Lomet, "Multi-table search forB-tree files,"ACM-SIGMOD, pp. 35-42, 1979.
[18] D. Lomet, "DigitalB-trees,"VLDB'81, ACM, pp. 333-334, Sept. 1981.
[19] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[20] E. Otoo, "Multikey trie hashing for scientific and statistical databases," inCODATA '87, P.S. Glazer, Ed. New York: Elsevier, 1987, pp. 35-40.
[21] E. Otoo, "Locally balanced compact trie hashing," presented at the 3rd Int. Conf. on Data and Knowledge Bases, Jerusalem, Israel, June 1988.
[22] M. Ouksel and P. Scheuerman, "Storage mapping for multidimensional linear dynamic hashing,"PODS '83, pp. 90-105, Mar. 1983.
[23] M. Regnier, "Trie hashing analysis," presented at the 4th Int. Conf. on Data Eng., Mar. 1987.
[24] A. L. Rosenberg and L. Snyder, "Time and space optimality inB-trees,"ACM-TODS, vol. 6, no. 1, pp. 174-193, 1981.
[25] Y. Sagiv, "Concurrent operations onB-trees with overtaking,"ACMPODS, pp. 28-37, Mar. 1985.
[26] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187-260, 1984.
[27] L. Torenvliet and P. Van Emde Boas, "The reconstructive and optimization of trie hashing functions,"VLDB '83, pp. 142-157, Nov. 1983.
[28] K. Vidyasankar, W. Litwin, and Y. Sagiv, "Concurrency and trie hashing."Acta Informatica, vol. 26, no. 7, pp. 597-614, 1989.
[29] D. Zegour, "Extensions de Hachage Digital," Ph.D. dissertation, Dauphine Univ., Paris, France, June 1988, p. 246.

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)
W.A. Litwin, N. Roussopoulos, G. Levy, W. Hong, "Trie Hashing with Controlled Load," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 678-691, July 1991, doi:10.1109/32.83904
Usage of this product signifies your acceptance of the Terms of Use.