Simple and Space-Efficient Minimal Perfect Hash Functions

@inproceedings{Botelho2007SimpleAS,
  title={Simple and Space-Efficient Minimal Perfect Hash Functions},
  author={Fabiano C. Botelho and Rasmus Pagh and Nivio Ziviani},
  booktitle={WADS},
  year={2007}
}
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.44n/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: 1. Evaluation of a PHF requires constant time. 2. The algorithms are simple to describe and implement… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 72 CITATIONS, ESTIMATED 34% COVERAGE

FILTER CITATIONS BY YEAR

2007
2019

CITATION STATISTICS

  • 14 Highly Influenced Citations

  • Averaged 4 Citations per year over the last 3 years

Similar Papers

Loading similar papers…