An improved hash code for scatter storage

Ward Douglas Maurer · Communications of the ACM · 1983

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.

Cited by 52 works. doi:10.1145/357980.357995 Open-access PDF

Authors

References