Skip to main content
SpringerLink
Log in

Multilevel trie hashing

  • Efficient Data Access
  • Conference paper
  • First Online:
Advances in Database Technology—EDBT '88 (EDBT 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 303))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bayer, R., Mc. Creight, E. Organization and maintenance of large ordered indexes. Acta Informatica, 1, 3 (1972), 173–189.

    Article  Google Scholar 

  2. Bayer, R., Unterauer, K. Prefix B-Trees. ACM TODS, 2, 1,(Mar 1977), 11–26.

    Google Scholar 

  3. Briandais (de la), R. File Searching Using Variable Length Keys. Proc. of Est. Joint Comp. Conf, 295–298.

    Google Scholar 

  4. Burkhard, W. Interpolation-Based Index Maintenance. PODS 83.ACM, (March 1983), 76–89.

    Google Scholar 

  5. Comer, D. The ubiquitous B-tree. ACM Comp. Surv. 11, 2 (June 1979), 121–137.

    Google Scholar 

  6. Date, C., J. An Introduction to Relational Database Systems. 4-th ed., Addison-Wesley, 1986, 639

    Google Scholar 

  7. Ellis, C., S. Extendible Hashing for Concurrent Operation and Distributed Data. PODS 83. ACM, (March 1983), 106–116.

    Google Scholar 

  8. 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. Ph. Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica, 20, 345–369 (1983).

    Article  Google Scholar 

  10. Fredkin, E. Trie Memory, CACM, 3, 490–499.

    Google Scholar 

  11. Gonnet, G., H. Handbook of ALGORITHMS and DATA STRUCTURES. Addison-Wesley, 1984.

    Google Scholar 

  12. Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, 1973.

    Google Scholar 

  13. Krishnamurty, R., Morgan S., P. Query Processing on Personal Computers — A Pragmatic Approach. VLDB-84, Singapore (Aug. 1984), 26–29.

    Google Scholar 

  14. 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. Larson, P., A. Dynamic hashing. BIT 18 (1978), 184–201.

    Google Scholar 

  16. Larson, P.,, A. A single file version of linear hashing with partial expansions. VLDB 82, ACM, (Sep 1982), 300–309.

    Google Scholar 

  17. Litwin, W. Virtual hashing: a dynamically changing hashing. VLDB 78, ACM, (Sep 1978), 517–523.

    Google Scholar 

  18. Litwin, W. Linear hashing: A new tool for files and tables addressing. VLDB 80, ACM, (Sep 1980), 212–223.

    Google Scholar 

  19. Litwin, W. Trie hashing. SIGMOD 81. ACM, (May 1981), 19–29.

    Google Scholar 

  20. 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. Litwin, Witold. Trie hashing: Further properties and performances. Int. Conf. on Foundation of Data Organisation. Kyoto, May 1985. Plenum Press.

    Google Scholar 

  22. Litwin, W., Lomet, D. Bounded Disorder Access Method. 2-nd Int. Conf. on Data Eng. IEEE, Los Angeles, (Feb. 1986).

    Google Scholar 

  23. Lomet, D., B. Multi-table search for B-tree files. ACM-SIGMOD, 1979, 35–42.

    Google Scholar 

  24. Lomet, D. Digital B-trees. VLDB 81. ACM, (Sep 1981), 333–344.

    Google Scholar 

  25. Lomet, D. Bounded Index Exponential Hashing. ACM TODS, 8, 1, (Mar 1983), 136–165.

    Google Scholar 

  26. Mullin, J., K. Tightly controlled linear hashing without separate overflow storage. BIT, 21, 4, (1891), 389–400.

    Google Scholar 

  27. Nievergelt, J., Hinterberger, H., Sevcik, K., C. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM TODS, (March 1984).

    Google Scholar 

  28. Orenstein, J. A Dynamic Hash File for Random and Sequential Accessing. VLDB 83, (Nov 1983), 132–141.

    Google Scholar 

  29. Ouksel, M. Scheuerman, P. Storage Mapping for Multidimensional Linear Dynamic Hashing. PODS 83. ACM, (March 1983), 90–105.

    Google Scholar 

  30. Ramamonohanarao, K., Sacks-Davis, R. Recursive Linear Hashing. ACM-TODS, 9, 3, (Sep. 1984).

    Google Scholar 

  31. 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. Rosenberg, A.,, L., Snyder, L. Time and space optimality in B-trees. ACM-TODS, 6,1 (1981), 174–193.

    Google Scholar 

  33. Samet, H. The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16, 2 (June 1984), 187–260.

    Article  Google Scholar 

  34. Scholl, M. New File Organizations Based on Dynamic Hashing. ACM TODS, 6, 1, (March 1981), 194–211.

    Google Scholar 

  35. Shou-Hsuan Stephen Huang. Height-Balanced Trees. ACM TODS, 10, 2 (1985), 261–284.

    Google Scholar 

  36. Tamminen, M. Extendible hashing with overflow. Inf. Proc. Lett. 15, 5, 1982, 227–232.

    Google Scholar 

  37. Torenvliet, L., Van Emde Boas, P. The Reconstructive and Optimization of Trie Hashing Functions. VLDB 83, (Nov. 1983), 142–157.

    Google Scholar 

  38. Tremblay, J-P., Sorenson, P., G. An Introduction to Data Structures. 2-nd ed., McGraw-Hill, 1984, 861.

    Google Scholar 

  39. Tropf, H., Herzog, H. Multidimensional range search in dynamically balanced trees. Agnew. Inf. 2, 71–77.

    Google Scholar 

  40. Wiederhold, G. Database design. McGraw-hill Book Company, 1983.

    Google Scholar 

  41. Yao, A.,, C. On random 2–3 trees. Acta Inf. 18, (1983), 159–170.

    Google Scholar 

  42. Zegour, D. Implementation du hachage digital multiniveaux. Techn. Rep., (Sep. 1986), INRIA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inria, 78153, Le Chesnay, France

    W. Litwin, D. Zegour & G. Levy

Authors
  1. W. Litwin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Zegour
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. Schmidt S. Ceri M. Missikoff

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Litwin, W., Zegour, D., Levy, G. (1988). Multilevel trie hashing. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19074-0_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-19074-0_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19074-5

  • Online ISBN: 978-3-540-39095-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation