Define Overflow Chaining

Another method will divide the pre-allocated table into two sections: the primary area to determine which keys are mapped and an area for collisions, generally termed the overflow area. While a collision takes place, a slot in the overflow area is employed for the new element and a link from the primary slot established as in a chained system. This is essentially similar as chaining, except that the overflow area is pre-allocated and thus probably faster to access. As along with re-hashing, the maximum number of elements should be known in advance, but in this case, two parameters should be estimated: the optimum size of the primary and overflow areas.