An improved hash code for scatter storage
- 1 January 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (1) , 36-38
- https://doi.org/10.1145/357980.357995
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- Scatter storage techniquesCommunications of the ACM, 1968