The linear quotient hash code

Authors:
James R. Bell;Charles H. Kaman
Affiliations:
Digital Equipment Corp., Maynard;Digital Equipment Corp., Maynard
Venue:
Communications of the ACM
Year:
1970

Citing 4
Cited 20

The use of quadratic residue research

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

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
Statistical behavior of fast hashing of variable length test strings

ACM SIGIR Forum
Hash Table Methods

ACM Computing Surveys (CSUR)
Pseudochaining in hash tables

Communications of the ACM
Packed scatter tables

Communications of the ACM
The quadratic hash method when the table size is not a prime number

Communications of the ACM
Weighted increment linear search for scatter tables

Communications of the ACM
The reallocation of hash-coded tables

Communications of the ACM
Reducing the retrieval time of scatter storage techniques

Communications of the ACM
Design and implementation of a diagnostic compiler for PL/I

Communications of the ACM
Technical correspondence

Communications of the ACM
An interactive system for allocating space in an efficient flexible manner

ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
An image matrix for accessing files

ACM '72 Proceedings of the ACM annual conference - Volume 1
The analysis of double hashing(Extended Abstract)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Minimizing the retrieval time of scatter storage techniques

ACM '78 Proceedings of the 1978 annual conference - Volume 2
A graduate course in database management

ACM SIGMOD Record
A machine independent fortran data management software system for scientific and engineering applications

AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
An introduction to computed chaining

AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Expandable open addressing hash table storage and retrieval

SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	48.34

Visualization

Abstract

A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance data and implementation hints are also given.