next up previous
Next: Pseudocode Up: l5 Previous: Universal Hash Functions

Open Addressing

*
All elements are stored in the hash table (no pointers).
*
If a hash slot is full, then probe other slots using the probe sequence until a slot is found or no slot can be found (overflow).
*
The hash function now becomes h(k,i), where i ranges over {0,1,..,m-1}.
h(k,i) returns the ith probe in the probe sequence.
*
The entire probe sequence must be a permutation of {0,1,..,m-1}.


next up previous
Next: Pseudocode Up: l5 Previous: Universal Hash Functions