- Authors:
- Kevin Karplus,
- Gary Haggard
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 hash functions have been found for sets of up to 667 words.
Cited By
- Brain M and Tharp A (1994). Using Tries to Eliminate Pattern Collisions in Perfect Hashing, IEEE Transactions on Knowledge and Data Engineering, 6:2, (239-247), Online publication date: 1-Apr-1994.
Haggard G and Karplus K Finding minimal perfect hash functions Proceedings of the seventeenth SIGCSE technical symposium on Computer science education, (191-193)- Haggard G and Karplus K (1986). Finding minimal perfect hash functions, ACM SIGCSE Bulletin, 18:1, (191-193), Online publication date: 1-Feb-1986.
Recommendations
Finding minimal perfect hash functions
SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science educationA 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 ...
Finding minimal perfect hash functions
Proceedings of the 17th SIGCSE symposium on Computer science educationA 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 ...
Indexing internal memory with minimal perfect hash functions
SBBD '08: Proceedings of the 23rd Brazilian symposium on DatabasesA perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each key can be retrieved from the table with a single probe. A minimal perfect ...