[PDF][PDF] Programming technique: An improved hash code for scatter storage
WD Maurer - Communications of the ACM, 1968 - dl.acm.org
WD Maurer
Communications of the ACM, 1968•dl.acm.orgIntroduced is a hash coding method based on fixed-point division rather than multiplication
or logical operations. This new method allows the hash table to have almost any length. Also
a new method of handling collisions is discussed. Known as quadratic search, this method is
faster than random search and free from the" clusters" that build up with a linear search.
or logical operations. This new method allows the hash table to have almost any length. Also
a new method of handling collisions is discussed. Known as quadratic search, this method is
faster than random search and free from the" clusters" that build up with a linear search.
Introduced is a hash coding method based on fixed-point division rather than multiplication or logical operations. This new method allows the hash table to have almost any length. Also a new method of handling collisions is discussed. Known as quadratic search, this method is faster than random search and free from the" clusters" that build up with a linear search.