A comparison of three strategies for computing letter oriented, minimal perfect hashing functions

Authors:
John A. Trono
Affiliations:
St. Michael's College, Colchester, VT
Venue:
ACM SIGPLAN Notices
Year:
1995

Citing 8
Cited 0

Fast identification of Ada and Modula-2 reserved words

Journal of Pascal, Ada & Modula-2
Hashing for Dynamic and Static Internal Tables

Computer
Practical minimal perfect hash functions for large databases

Communications of the ACM
A modulus oriented hash function for the construction of minimal perfect tables

ACM SIGPLAN Notices
An undergraduate project to compute minimal perfect hashing functions

ACM SIGCSE Bulletin
Minimal perfect hash functions made simple

Communications of the ACM
Using Tries to Eliminate Pattern Collisions in Perfect Hashing

IEEE Transactions on Knowledge and Data Engineering
A letter oriented minimal perfect hashing function

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper will discuss improvements to Cichelli's method for computing the set of weights used for minimal perfect hashing functions[1]. The major modifications investigated here pertain to adding a "MOD number_of_keys" operation to the hashing function, and to the removal of unnecessary backtracking due to "guaranteed collisions".