Weighted increment linear search for scatter tables

Authors:
Fabrizio Luccio
Affiliations:
Univ. of Pisa, Pisa, Italy
Venue:
Communications of the ACM
Year:
1972

Citing 6
Cited 4

The use of quadratic residue research

Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering

Communications of the ACM
Full table quadratic searching for scatter storage

Communications of the ACM
The linear quotient hash code

Communications of the ACM
Programming Technique: An improved hash code for scatter storage

Communications of the ACM
Scatter storage techniques

Communications of the ACM

A compendium of key search references

ACM SIGIR Forum
Hash Table Methods

ACM Computing Surveys (CSUR)
Comment on weighted increment linear search for scatter tables

Communications of the ACM
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	48.23

Visualization

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 = 2r. It allows full table searching, and practically eliminates primary clustering at a very low cost.