Linear hashing

The hash table maintains a pointer that tracks the next bucket to split.

-> When any bucket overflows, split the bucket at the pointer location.

Use multiple hashes to find the right bucket for a given key.

Can use different overflow criterion:

-> Space Utilization

-> Average Length of Overflow Chains