Weighted increment linear search for scatter tables
- 1 December 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (12) , 1045-1047
- https://doi.org/10.1145/361598.361617
Abstract
A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2 r . It allows full table searching, and practically eliminates primary clustering at a very low cost.Keywords
This publication has 6 references indexed in Scilit:
- The linear quotient hash codeCommunications of the ACM, 1970
- Full table quadratic searching for scatter storageCommunications of the ACM, 1970
- The use of quadratic residue researchCommunications of the ACM, 1970
- The quadratic quotient methodCommunications of the ACM, 1970
- Scatter storage techniquesCommunications of the ACM, 1968
- Programming Technique: An improved hash code for scatter storageCommunications of the ACM, 1968