Skip to main content
Springer Nature Link
Log in

A Robust Scheme for Multilevel Extendible Hashing

  • Conference paper
Computer and Information Sciences - ISCIS 2003 (ISCIS 2003)

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

Included in the following conference series:

  • 743 Accesses

Abstract

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.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Carter, J.L., Wegman, M.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143–154 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  3. Enbody, R.J., Du, H.C.: Dynamic hashing schemes. ACM Computing Surveys 20(2), 85–113 (1988)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  5. Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Informatica 20(4), 345–369 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  6. Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Technical Report 19/01, Universität Mannheim (2001), http://pi3.informatik.uni-mannheim.de

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Lomet, D.B.: Bounded index exponential hashing. ACM Transactions on Database Systems 8(1), 136–165 (1983)

    Article  Google Scholar 

  9. Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J.: Advanced Database Indexing. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  10. Mendelson, H.: Analysis of extendible hashing. IEEE Trans. Software Eng. 8(6), 611–619 (1982)

    Article  Google Scholar 

  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. Ramakrishna, M.V., Larson, P.A.: File organization using composite perfect hashing. ACM Transactions on Database Systems 14(2), 231–263 (1989)

    Article  Google Scholar 

  13. Ramamohanarao, K., Lloyd, J.W.: Dynamic hashing schemes. The Computer Journal 25(4), 478–485 (1982)

    Google Scholar 

  14. Tamminen, M.: Order preserving extendible hashing and bucket tries. BIT 21, 419–435 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Mannheim, Mannheim, Germany

    Sven Helmer, Thomas Neumann & Guido Moerkotte

Authors
  1. Sven Helmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guido Moerkotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, Middle East Technical University, Ankara, Turkey

    Adnan Yazıcı

  2. Department of Computer Engineering, Middle East Technical University, 06531, Ankara, Turkey

    Cevat Şener

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Helmer, S., Neumann, T., Moerkotte, G. (2003). A Robust Scheme for Multilevel Extendible Hashing. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

  • Online ISBN: 978-3-540-39737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics