Perfect hashing

• The set of keys is given and never changes.

• Find “simple” hash function so that there are no collisions.

• Example: reserved words in a compiler.

• Hard to do but can be very useful.

• Example (M ~ 6N)

(a K mod b) mod M

• Takes time O(n3 log n) to compute.

Previous slide

Next slide

Back to first slide

View graphic version