Everything about Perfect hash function

🧭 Start here: a 6-step reading path

1. Read the overview: Perfect hash functionA 5-minute orientation
2. Skim a recent paper: Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHashInfluential work since 2022
3. Pick up a classic book: Data structures and algorithms in JavaThe most-reprinted book on the subject
4. Read the landmark paper: Minimal perfect hash functions made simpleCited 108 times
5. Go sideways: Hash tableA closely related topic
6. Go sideways: Retrieval Data StructureA closely related topic

🏆 Landmark papers (most cited)

• Minimal perfect hash functions made simple

  Richard J. Cichelli · 1980 · Communications of the ACM · 108 citations

• An optimal algorithm for generating minimal perfect hash functions

  Zbigniew J. Czech, George Havas, Bohdan S. Majewski · 1992 · Information Processing Letters · 73 citations

• Practical minimal perfect hash functions for large databases

  Edward A. Fox, Lenwood S. Heath, Qi Fan Chen · 1992 · Communications of the ACM · 69 citations

• A polynomial time generator for minimal perfect hash functions

  Thomas J. Sager · 1985 · Communications of the ACM · 39 citations

• Order-preserving minimal perfect hash functions and information retrieval

  Edward A. Fox, Qi Fan Chen, Amjad M. Daoud · 1991 · ACM Transactions on Information Systems · 36 citations

• Balanced families of perfect hash functions and their applications

  Noga Alon, Shai Gutner · 2010 · ACM Transactions on Algorithms · 16 citations

• Technical Response to: On Cichelli's Minimal Perfect Hash Functions Method

  · 1980 · Communications of the ACM · 13 citations

• A fast implementation of a perfect hash function for picture objects

  Sanjiv K. Bhatia, Chaman L. Sabharwal · 1994 · Pattern Recognition · 11 citations

🆕 Influential since 2022

• Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash

  Giulio Ermanno Pibiri, Roberto Trani · 2024 · IEEE Transactions on Knowledge and Data Engineering · 13 citations

📚 Books worth reading

• Data structures and algorithms in JavaAdam Drozdek · 2001
• TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
• Foundations of Parallel ProgrammingT. G. Lewis · 1993
• Information and Communications SecurityTat Wing Chim · 2012
• Data structures with JavaHubbard, J. R. · 2004
• Data structures using C and C++Yedidyah Langsam · 2000
• Data Structures and Algorithms in C++Adam Drozdek · 2000
• Data structures using Cand C[plus plus]Yedidyah Langsam · 1996

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Hash table In computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array…
• Retrieval Data Structure In computer science, a retrieval data structure, also known as static function, is a space-efficient dictionary-like data type composed of a collection…
• Cuckoo hashing Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup…
• Hash function A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support…
• Dynamic perfect hashing In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive…
• Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…
• Hopscotch hashing Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing. It is…
• Integer sorting In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer…