Skip to main content
SpringerLink
Log in

Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1999)

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

Included in the following conference series:

Abstract

A new way of constructing (minimal) perfect hash functions is described. The technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Two memory probes suffice for evaluation of the function. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal.

Supported in part by the ESPRIT Long Term Research Programme of the EU under project number 20244 (ALCOM-IT)

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Arne Andersson, Peter Bro Miltersen, Søren Riis, and Mikkel Thorup. Static dictionaries on AC0 RAMs: query time θ(\( \theta (\sqrt {\log n/\log \log n)} \) log n/ log log n) is necessary and sufficient. In Proceedings of 37th Annual Symposium on Foundations of Computer Science, pages 441–450. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.

    Google Scholar 

  2. J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. J. Comput. System Sci., 18(2):143–154, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  3. Zbigniew J. Czech, George Havas, and Bohdan S. Majewski. Perfect hashing. Theoretical Computer Science, 182(1-2):1–143, 15 August 1997.

    Article  MathSciNet  MATH  Google Scholar 

  4. Martin Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In STACS 96 (Grenoble, 1996), pages 569–580. Springer, Berlin, 1996.

    Google Scholar 

  5. Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Automata, languages and programming (Coventry, 1990), pages 6–19. Springer, New York, 1990.

    Chapter  Google Scholar 

  6. Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, and Amjad M. Daoud. Practical minimal perfect hash functions for large databases. Communications of the ACM, 35(1):105–121, January 1992.

    Article  Google Scholar 

  7. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538–544, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  8. Kurt Mehlhorn. Data structures and algorithms. 1. Springer-Verlag, Berlin, 1984. Sorting and searching.

    MATH  Google Scholar 

  9. Rasmus Pagh. Hash and displace: Efficient evaluation of minimal perfect hash functions. Research Series RS-99-13, BRICS, Department of Computer Science, University of Aarhus, May 1999.

    Google Scholar 

  10. Robert Endre Tarjan and Andrew Chi Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606–611, November 1979.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Department of Computer Science, University of Aarhus, 8000, Aarhus C, Denmark

    Rasmus Pagh

Authors
  1. Rasmus Pagh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pagh, R. (1999). Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66279-2

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation