Skip to main content
SpringerLink
Log in

On the performance evaluation of extendible hashing and trie searching

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A class of trees occurs both in digital searching and in schemes for maintaining dynamic hash tables. We study the distribution of height in these trees using the saddle point method of complex analysis. As a result, we derive a precise evaluation of the memory requirements of extendible hashing — a dynamic hashing scheme — and discuss some related implementation issues.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. deBruijn, N.G.: Asymptotic methods in analysis. Amsterdam: North-Holland 1961

    Google Scholar 

  2. David, F.N., Barton, D.E.: Combinational chance. London: Charles Griffin 1962

    Google Scholar 

  3. Dwass, M.: More birthday surprises. JCT 7, 258–261 (1969)

    Google Scholar 

  4. Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing — a fast access method for dynamic files. ACM Trans. on Database System 4, 315–344 (1979)

    Google Scholar 

  5. Gonnet, G.: Expected length of the longest probe sequence in hashing. JACM 28, 289–304 (1981)

    Google Scholar 

  6. Henrici, P.: Applied and computational complex analysis. Vol.2. New York: J. Wiley 1978

    Google Scholar 

  7. Klamkin, M.S., Newman, D.J.: Extensions of the birthday surprise. JCT 3, 279–282 (1967)

    Google Scholar 

  8. Knuth, D.E.: The art of computer programming. Vol.3. Reading: Addison-Wesley 1973

    Google Scholar 

  9. Larson, P.A.: Dynamic hashing. BIT 18, 184–201 (1978)

    Google Scholar 

  10. Litwin, W.: Virtual hashing: A dynamically changing hashing, in Proc. Very Large Data Bases Conf., Berlin, pp. 517–523, 1978

  11. Mendelson, H.: Extendible hashing: Analysis for design. Rochester University Report No.8019, (1980)

  12. Regnier, M.: On the average height of trees in digital searching and dynamic hashing. IPL 13, 64–66 (1981)

    Google Scholar 

  13. Yao, A.: A note on the analysis of extendible hashing. IPL 11, 84–86 (1980)

    Google Scholar 

  14. Flajolet, Ph., Steyaert, J.M.: A branching process arising in dynamic hashing, trie searching and polynomial factorization. Proc. ICALP 82, Lecture Notes in Comp. Sc. 140, 239–251 (1982)

    Google Scholar 

  15. Riordan, J.: An Introduction to Combinatorial Analysis. New York: J. Wiley 1958

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Rocquencourt BP105, F-78153, Le Chesnay Cedex, France

    Philippe Flajolet

Authors
  1. Philippe Flajolet
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was done for the most part while the author was visiting the IBM Research Laboratory in San Jose

Rights and permissions

Reprints and permissions

About this article

Cite this article

Flajolet, P. On the performance evaluation of extendible hashing and trie searching. Acta Informatica 20, 345–369 (1983). https://doi.org/10.1007/BF00264279

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264279

Keywords

Search

Navigation