A Faster Algorithm for Constructing Minimal Perfect Hash Functions

  title={A Faster Algorithm for Constructing Minimal Perfect Hash Functions},
  author={Edward A. Fox and Qi Fan Chen and Lenwood S. Heath},
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this problem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is very close to the theoretical lower bound, i.e., around 2 bits per key. The various stages of processing are detailed, along with analytical and empirical results, including timing for a set of over 3.8… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 29 extracted citations

PRESAGE: PRivacy-preserving gEnetic testing via SoftwAre Guard Extension

BMC Medical Genomics • 2017
View 4 Excerpts
Highly Influenced

Hardware accelerated pattern matching based on Deterministic Finite Automata with perfect hashing

13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems • 2010
View 3 Excerpts

Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing

2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools • 2009
View 3 Excerpts

53 Citations

Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…