Finding minimal perfect hash functions

Authors:
Gary Haggard;Kevin Karplus
Affiliations:
Univ. of Maine at Orono, Orono;Cornell Univ., Ithaca, NY
Venue:
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
Year:
1986

Citing 5
Cited 3

A polynomial time generator for minimal perfect hash functions

Communications of the ACM
Minimal perfect hash functions made simple

Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets

Communications of the ACM
Universal classes of hash functions (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Finding Minimal Perfect Hash Functions

Finding Minimal Perfect Hash Functions

Hashing for Dynamic and Static Internal Tables

Computer
A compendium of key search references

ACM SIGIR Forum
Using Tries to Eliminate Pattern Collisions in Perfect Hashing

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction of this function relies on a backtracking algorithm for numbering the vertices of the graph. Careful selection of the graph model limits the time spent searching. Good results have been obtained for dictionaries of up to 181 words. Using the same techniques, non-minimal perfect has functions have been found for sets of up to 667 words.