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
Programming Technique: An improved hash code for scatter storage
Communications of the ACM
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
A compendium of key search references
ACM SIGIR Forum
ACM Computing Surveys (CSUR)
Communications of the ACM
The quadratic hash method when the table size is not a prime number
Communications of the ACM
| Hi-index | 48.25 |
It has previously been claimed [1 and 2] that the quadratic hash table search method of Maurer cannot usefully be applied to tables of size 2n. This is not so; the method can in fact be applied to tables of size pn for any prime p. It is shown below that rather simple conditions on the coefficients suffice to guarantee that all table locations will be examined once and only once. Specifically, if the equation is k + bi2 + ai mod pn (*) where k is the initial hash address and 0 ≤ i pn, then, if p divides b but not a, the range of values is all the least positive residues of pn. To prove that all values are covered, we consider some fixed value, say k + bi20 + ai0 mod pn and ask, what conditions must be true if the congruence equation k + bi2 + ai ≡ k + bi02 + ai0 mod pn is to have solutions i, 0 ≤ i pn, other than i0?