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

Authors:
Vladimir Batagelj
Affiliations:
Univ. of Ljubljana, Ljubljana, Yugoslavia
Venue:
Communications of the ACM
Year:
1975

Citing 7
Cited 3

Quadratic search for hash tables of sizes P n

Communications of the ACM
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
Comment on Bell's quadratic quotient method for hash coded searching

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

A compendium of key search references

ACM SIGIR Forum
Packed scatter tables

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

ACM '78 Proceedings of the 1978 annual conference - Volume 2

Quantified Score

Hi-index	48.23

Visualization

Abstract

Previous work on quadratic hash methods is limited mainly to the case where the table size is a prime number. Here, certain results are derived for composite numbers. It is shown that all composite numbers containing at least the square of one of the component primes have full-period integer-coefficient quadratic hash functions.