Multilevel trie hashing

  • W. Litwin
  • D. Zegour
  • G. Levy
Efficient Data Access
Part of the Lecture Notes in Computer Science book series (LNCS, volume 303)


Trie hashing is one of the fastest access methods to primary key ordered dynamic files. The key address is computed through a trie usually in core. Key search needs then at most one disk access. For very large files, trie size may however become prohibitive. We present an extension of the method, where the trie is split into subtries stored each in a page on the disk. Address computation requires the core for a single page. Two disk accesses may suffice for any key search in a Gbyte file.


Internal Node Range Query Disk Access Split Node Left Child 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /BAY72/.
    Bayer, R., Mc. Creight, E. Organization and maintenance of large ordered indexes. Acta Informatica, 1, 3 (1972), 173–189.CrossRefGoogle Scholar
  2. /BAY77/.
    Bayer, R., Unterauer, K. Prefix B-Trees. ACM TODS, 2, 1,(Mar 1977), 11–26.Google Scholar
  3. /BRI59/.
    Briandais (de la), R. File Searching Using Variable Length Keys. Proc. of Est. Joint Comp. Conf, 295–298.Google Scholar
  4. /BUR83/.
    Burkhard, W. Interpolation-Based Index Maintenance. PODS 83.ACM, (March 1983), 76–89.Google Scholar
  5. /COM79/.
    Comer, D. The ubiquitous B-tree. ACM Comp. Surv. 11, 2 (June 1979), 121–137.Google Scholar
  6. /DAT86/.
    Date, C., J. An Introduction to Relational Database Systems. 4-th ed., Addison-Wesley, 1986, 639Google Scholar
  7. /ELL83/.
    Ellis, C., S. Extendible Hashing for Concurrent Operation and Distributed Data. PODS 83. ACM, (March 1983), 106–116.Google Scholar
  8. /FAG79/.
    Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R. Extendible hashing — a fast access method for dynamic files. ACM-TODS, 4, 3, (Sep 1979), 315–344.Google Scholar
  9. /FLA83/.
    Ph. Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica, 20, 345–369 (1983).CrossRefGoogle Scholar
  10. /FRE60/.
    Fredkin, E. Trie Memory, CACM, 3, 490–499.Google Scholar
  11. /GON84/.
    Gonnet, G., H. Handbook of ALGORITHMS and DATA STRUCTURES. Addison-Wesley, 1984.Google Scholar
  12. /KNU73/.
    Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, 1973.Google Scholar
  13. /KRI84/.
    Krishnamurty, R., Morgan S., P. Query Processing on Personal Computers — A Pragmatic Approach. VLDB-84, Singapore (Aug. 1984), 26–29.Google Scholar
  14. /JON81/.
    de Jonge, W., Tanenbaum, A., S., Van de Riet R. A Fast, Tree-based Access Method for Dynamic Files. Rapp IR-70, Vrije Univ. Amsterdam, (Jul 1981), 20.Google Scholar
  15. /LAR78/.
    Larson, P., A. Dynamic hashing. BIT 18 (1978), 184–201.Google Scholar
  16. /LAR82a/.
    Larson, P.,, A. A single file version of linear hashing with partial expansions. VLDB 82, ACM, (Sep 1982), 300–309.Google Scholar
  17. /LIT78/.
    Litwin, W. Virtual hashing: a dynamically changing hashing. VLDB 78, ACM, (Sep 1978), 517–523.Google Scholar
  18. /LIT80/.
    Litwin, W. Linear hashing: A new tool for files and tables addressing. VLDB 80, ACM, (Sep 1980), 212–223.Google Scholar
  19. /LIT81/.
    Litwin, W. Trie hashing. SIGMOD 81. ACM, (May 1981), 19–29.Google Scholar
  20. /LIT84/.
    Litwin, W. Data Access Methods and Structures to Enhance Performance. Database performance, State of the Art Report 12:4. Pergamon Infotech, 1984, 93–108.Google Scholar
  21. /LIT85/.
    Litwin, Witold. Trie hashing: Further properties and performances. Int. Conf. on Foundation of Data Organisation. Kyoto, May 1985. Plenum Press.Google Scholar
  22. /LIT86/.
    Litwin, W., Lomet, D. Bounded Disorder Access Method. 2-nd Int. Conf. on Data Eng. IEEE, Los Angeles, (Feb. 1986).Google Scholar
  23. /LOM79/.
    Lomet, D., B. Multi-table search for B-tree files. ACM-SIGMOD, 1979, 35–42.Google Scholar
  24. /LOM81/.
    Lomet, D. Digital B-trees. VLDB 81. ACM, (Sep 1981), 333–344.Google Scholar
  25. /LOM83a/.
    Lomet, D. Bounded Index Exponential Hashing. ACM TODS, 8, 1, (Mar 1983), 136–165.Google Scholar
  26. /MUL81/.
    Mullin, J., K. Tightly controlled linear hashing without separate overflow storage. BIT, 21, 4, (1891), 389–400.Google Scholar
  27. /NIE84/.
    Nievergelt, J., Hinterberger, H., Sevcik, K., C. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM TODS, (March 1984).Google Scholar
  28. /ORE83/.
    Orenstein, J. A Dynamic Hash File for Random and Sequential Accessing. VLDB 83, (Nov 1983), 132–141.Google Scholar
  29. /OUK83/.
    Ouksel, M. Scheuerman, P. Storage Mapping for Multidimensional Linear Dynamic Hashing. PODS 83. ACM, (March 1983), 90–105.Google Scholar
  30. [RAM84/.
    Ramamonohanarao, K., Sacks-Davis, R. Recursive Linear Hashing. ACM-TODS, 9, 3, (Sep. 1984).Google Scholar
  31. /REG82/.
    Regnier, M. Linear hashing with groups of reorganization. An algorithm for files without history. In Sheuermann P. (ed): Improving Database Usability and Responsiveness, Academic Press, (1982), 257–272.Google Scholar
  32. /ROS81/.
    Rosenberg, A.,, L., Snyder, L. Time and space optimality in B-trees. ACM-TODS, 6,1 (1981), 174–193.Google Scholar
  33. /SAM84/.
    Samet, H. The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16, 2 (June 1984), 187–260.CrossRefGoogle Scholar
  34. /SCH81/.
    Scholl, M. New File Organizations Based on Dynamic Hashing. ACM TODS, 6, 1, (March 1981), 194–211.Google Scholar
  35. /SHO85/.
    Shou-Hsuan Stephen Huang. Height-Balanced Trees. ACM TODS, 10, 2 (1985), 261–284.Google Scholar
  36. /TAM82/.
    Tamminen, M. Extendible hashing with overflow. Inf. Proc. Lett. 15, 5, 1982, 227–232.Google Scholar
  37. /TOR83/.
    Torenvliet, L., Van Emde Boas, P. The Reconstructive and Optimization of Trie Hashing Functions. VLDB 83, (Nov. 1983), 142–157.Google Scholar
  38. /TRE85/.
    Tremblay, J-P., Sorenson, P., G. An Introduction to Data Structures. 2-nd ed., McGraw-Hill, 1984, 861.Google Scholar
  39. /TRO81/.
    Tropf, H., Herzog, H. Multidimensional range search in dynamically balanced trees. Agnew. Inf. 2, 71–77.Google Scholar
  40. /WIE83/.
    Wiederhold, G. Database design. McGraw-hill Book Company, 1983.Google Scholar
  41. /YAO78/.
    Yao, A.,, C. On random 2–3 trees. Acta Inf. 18, (1983), 159–170.Google Scholar
  42. /ZEG86/.
    Zegour, D. Implementation du hachage digital multiniveaux. Techn. Rep., (Sep. 1986), INRIA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • W. Litwin
    • 1
  • D. Zegour
    • 1
  • G. Levy
    • 1
  1. 1.InriaLe ChesnayFrance

Personalised recommendations