https://arxiv.org/abs/2506.06536

Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member
institutions, and all contributors. Donate
 
arxiv logo > cs > arXiv:2506.06536
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv logo
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Data Structures and Algorithms

arXiv:2506.06536 (cs)
[Submitted on 6 Jun 2025]

Title:Modern Minimal Perfect Hashing: A Survey

Authors:Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh, Giulio
Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer
View a PDF of the paper titled Modern Minimal Perfect Hashing: A
Survey, by Hans-Peter Lehmann and 6 other authors
View PDF

    Abstract:Given a set $S$ of $n$ keys, a perfect hash function for
    $S$ maps the keys in $S$ to the first $m \geq n$ integers without
    collisions. It may return an arbitrary result for any key not in
    $S$ and is called minimal if $m = n$. The most important
    parameters are its space consumption, construction time, and
    query time. Years of research now enable modern perfect hash
    functions to be extremely fast to query, very space-efficient,
    and scale to billions of keys. Different approaches give
    different trade-offs between these aspects. For example, the
    smallest constructions get within 0.1% of the space lower bound
    of $\log_2(e)$ bits per key. Others are particularly fast to
    query, requiring only one memory access. Perfect hashing has many
    applications, for example to avoid collision resolution in static
    hash tables, and is used in databases, bioinformatics, and
    stringology.
    Since the last comprehensive survey in 1997, significant progress
    has been made. This survey covers the latest developments and
    provides a starting point for getting familiar with the topic.
    Additionally, our extensive experimental evaluation can serve as
    a guide to select a perfect hash function for use in
    applications.

Subjects: Data Structures and Algorithms (cs.DS)
Cite as:  arXiv:2506.06536 [cs.DS]
          (or arXiv:2506.06536v1 [cs.DS] for this version)
          https://doi.org/10.48550/arXiv.2506.06536
          Focus to learn more
          arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Hans-Peter Lehmann [view email]
[v1] Fri, 6 Jun 2025 21:06:23 UTC (916 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Modern Minimal Perfect Hashing: A
    Survey, by Hans-Peter Lehmann and 6 other authors
  * View PDF
  * TeX Source
  * Other Formats

view license
Current browse context:
cs.DS
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

a export BibTeX citation Loading...

BibTeX formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Reddit logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Litmaps Toggle
Litmaps (What is Litmaps?)
[ ] scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
( ) Code, Data, Media

Code, Data and Media Associated with this Article

[ ] alphaXiv Toggle
alphaXiv (What is alphaXiv?)
[ ] Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
[ ] DagsHub Toggle
DagsHub (What is DagsHub?)
[ ] GotitPub Toggle
Gotit.pub (What is GotitPub?)
[ ] Huggingface Toggle
Hugging Face (What is Huggingface?)
[ ] Links to Code Toggle
Papers with Code (What is Papers with Code?)
[ ] ScienceCast Toggle
ScienceCast (What is ScienceCast?)
( ) Demos

Demos

[ ] Replicate Toggle
Replicate (What is Replicate?)
[ ] Spaces Toggle
Hugging Face Spaces (What is Spaces?)
[ ] Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
( ) Related Papers

Recommenders and Search Tools

[ ] Link to Influence Flower
Influence Flower (What are Influence Flowers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)

  * Author
  * Venue
  * Institution
  * Topic

( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack