A Good Double Hash Function…

• is quick to evaluate.

• differs from the original hash function.

• never evaluates to 0 (mod size).

One good choice is to choose a prime R < size and:

hash2(x) = R - (x mod R)

Previous slide

Next slide

Back to first slide

View graphic version