MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Hash and Displace: Ecient Evaluation of Minimal Perfect Hash Functions

Download:
Download as a PDF | Download as a PS
by Rasmus Pagh
http://www.brics.dk/Projects/ALCOMIT/pagh99.ps
Add To MetaCart

Abstract:

A new way of constructing (minimal) perfect hash functions is described. The technique is a mixture of two well-known ones, and yields simple as well as ecient hashing schemes. More specically, the overhead associated with resolving buckets in two-level hashing schemes is reduced considerably. 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 xed 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. 1

Citations

470 Universal classes of hash functions – Carter, Wegman - 1979
34 The spatial complexity of oblivious k-probe hash functions – Schmidt, Siegel - 1990
32 Sorting and Searching on the Word RAM – Hagerup - 1998
31 An optimal algorithm for generating minimal perfect hash functions – Czech, Havas, et al. - 1992
30 Practical minimal perfect hash functions for large databases – Fox, Heath, et al. - 1992
27 Universal hashing and k-wise independent random variables via integer arithmetic without primes – Dietzfelbinger - 1996
19 A faster algorithm for constructing minimal perfect hash functions – Fox, Chen, et al. - 1992
19 Szemeredi: Storing a sparse table with O(1) worst case access time – Fredman, Komlos, et al. - 1984
16 Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries – Miltersen - 1998
13 Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time – Dietzfelbinger - 1990
13 Endre Tarjan and Andrew Chi Chih Yao. Storing a sparse table – Robert - 1979
12 Faster deterministic dictionaries – Pagh - 2000
3 Graph-theoretic obstacles to perfect hashing – Havas, Majewski - 1993
3 Data structures and algorithms. 1 – Mehlhorn - 1984
View or Download | Add to My Collection | Correct Errors