OBHTs: choosing the hash function
The hash function should be efficient.
The hash function should distribute the entries evenly over the buckets, with few long clusters.
- In an OHBT with s = 1, a cluster will form when several entries fall into the same or adjacent buckets.