Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
DOI:
https://doi.org/10.7146/brics.v6i13.20070Resumé
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations. The number of accesses to memory is two, one of which is to a fixed location. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal. The hash function description ("program") for a set of size n occupies O(n) words, and can be constructed in expected O(n) time.
Downloads
Publiceret
1999-01-13
Citation/Eksport
Pagh, R. (1999). Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. BRICS Report Series, 6(13). https://doi.org/10.7146/brics.v6i13.20070
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).