A Robust Scheme for Multilevel Extendible Hashing

  • Sven Helmer
  • Thomas Neumann
  • Guido Moerkotte
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2869)


Dynamic hashing, while surpassing other access methods for uniformly distributed data, usually performs badly for non-uniformly distributed data. We propose a robust scheme for multi-level extendible hashing, allowing efficient processing of skewed data as well as uniformly distributed data. In order to test our access method, we implemented it and compared it to several existing hashing schemes. The results of the experimental evaluation demonstrate the superiority of our approach in both index size and performance.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carter, J.L., Wegman, M.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143–154 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Du, D.H.C., Tong, S.-R.: Multilevel extendible hashing: A file structure for very large databases. IEEE Trans. on Knowledge and Data Engineering 3(3), 357–370 (1991)CrossRefGoogle Scholar
  3. 3.
    Enbody, R.J., Du, H.C.: Dynamic hashing schemes. ACM Computing Surveys 20(2), 85–113 (1988)CrossRefGoogle Scholar
  4. 4.
    Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing – a fast access method for dynamic files. ACM Transactions on Database Systems 4(3), 315–344 (1979)CrossRefGoogle Scholar
  5. 5.
    Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Informatica 20(4), 345–369 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Technical Report 19/01, Universität Mannheim (2001),
  7. 7.
    Larson, P.A.: Dynamic hashing. BIT 18, 184–201 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Lomet, D.B.: Bounded index exponential hashing. ACM Transactions on Database Systems 8(1), 136–165 (1983)CrossRefGoogle Scholar
  9. 9.
    Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J.: Advanced Database Indexing. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
  10. 10.
    Mendelson, H.: Analysis of extendible hashing. IEEE Trans. Software Eng. 8(6), 611–619 (1982)CrossRefGoogle Scholar
  11. 11.
    Otoo, E.J.: Linearizing the directory growth in order preserving extendible hashing. In: Int. Conf. on Data Engineering, pp. 580–588 (1988)Google Scholar
  12. 12.
    Ramakrishna, M.V., Larson, P.A.: File organization using composite perfect hashing. ACM Transactions on Database Systems 14(2), 231–263 (1989)CrossRefGoogle Scholar
  13. 13.
    Ramamohanarao, K., Lloyd, J.W.: Dynamic hashing schemes. The Computer Journal 25(4), 478–485 (1982)Google Scholar
  14. 14.
    Tamminen, M.: Order preserving extendible hashing and bucket tries. BIT 21, 419–435 (1981)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sven Helmer
    • 1
  • Thomas Neumann
    • 1
  • Guido Moerkotte
    • 1
  1. 1.University of MannheimMannheimGermany

Personalised recommendations