Skip to main content
Conference Proceedings

Hash and displace: Efficient evaluation of minimal perfect hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1663 49-54
DOI: 10.1007/3-540-48447-7_5
19Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new way of constructing (minimal) perfect hash functions is described. The technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Two memory probes suffice for evaluation of the function. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal.

Cite

CITATION STYLE

APA

Pagh, R. (1999). Hash and displace: Efficient evaluation of minimal perfect hash functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1663, pp. 49–54). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free