Simple and space-efficient minimal perfect hash functions

Authors:
Fabiano C. Botelho;Rasmus Pagh;Nivio Ziviani
Affiliations:
Dept. of Computer Science, Federal Univ. of Minas Gerais, Belo Horizonte, Brazil;Computational Logic and Algorithms Group, IT Univ. of Copenhagen, Denmark;Dept. of Computer Science, Federal Univ. of Minas Gerais, Belo Horizonte, Brazil
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 15
Cited 13

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
The spatial complexity of oblivious k-probe Hash functions

SIAM Journal on Computing
Practical minimal perfect hash functions for large databases

Communications of the ACM
A faster algorithm for constructing minimal perfect hash functions

SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Improved bounds for covering complete uniform hypergraphs

Information Processing Letters
Perfect hashing

Theoretical Computer Science
Linear hash functions

Journal of the ACM (JACM)
Low Redundancy in Static Dictionaries with Constant Query Time

SIAM Journal on Computing
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Minimal Perfect Hashing in Nearly Minimal Space

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Simple Minimal Perfect Hashing in Less Space

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Perfect spatial hashing

ACM SIGGRAPH 2006 Papers
Balanced allocation and dictionaries with tightly packed constant size bins

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A practical minimal perfect hashing method

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Maintaining external memory efficient hash tables

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

External perfect hashing for very large key sets

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Semi-external LTL Model Checking

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Distributed perfect hashing for very large key sets

Proceedings of the 3rd international conference on Scalable information systems
Indexing internal memory with minimal perfect hash functions

SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Faster and Space-Optimal Edit Distance "1" Dictionary

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Perfect hashing for state spaces in BDD representation

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
High speed pattern matching algorithm based on deterministic finite automata with faulty transition table

Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Divide and discriminate: algorithm for deterministic and fast hash lookups

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Indexing methods for approximate dictionary searching: Comparative analysis

Journal of Experimental Algorithmics (JEA)
Minimal perfect hashing: A competitive method for indexing internal memory

Information Sciences: an International Journal
Theory and practice of monotone minimal perfect hashing

Journal of Experimental Algorithmics (JEA)
Practical perfect hashing in nearly optimal space

Information Systems
Design strategies for minimal perfect hash functions

SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A perfect hash function (PHF) h : U → [0,m - 1] for a key set S is a function that maps the keys of S to unique values. The minimum amount of space to represent a PHF for a given set S is known to be approximately 1.44n2/m bits, where n = |S|. In this paper we present new algorithms for construction and evaluation of PHFs of a given set (for m = n and m = 1.23n), with the following properties: Evaluation of a PHF requires constant time.