Graphs, Hypergraphs and Hashing

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating minimal perfect hash functions which allow an arbitrary order to be specified for the keys. We show that almost all members of the family are space and time optimal, and we identify the one with minimum constants. Members of the family generate a minimal perfect hash function in two steps. First a special kind of function into an r–graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong practical and theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions. Key words: Data structures, probabilistic algorithms, analysis of...

• Type: Conference
• Year: 1993
• Where: WG
• Authors: George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
• Keywords: Memory Efficient Storage, Minimal Perfect Hash, Perfect Hash Functions, Theoretical Computer Science, WG 1993