Full table quadratic searching for scatter storage
- 1 August 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (8) , 481-482
- https://doi.org/10.1145/362705.362709
Abstract
The quadratic residue search method for hash tables avoids much of the clustering experienced with a linear search method. The simple quadratic search only accesses half the table. It has been shown that when the length of the table is a prime of the form 4 n + 3, where n is an integer, the whole table may be accessed by two quadratic searches plus a separate access for the original entry point. A search method is presented which is computationally simple, has all the advantages of the quadratic search, and yet accesses all the table in one sweep.Keywords
This publication has 3 references indexed in Scilit:
- The use of quadratic residue researchCommunications of the ACM, 1970
- Scatter storage techniquesCommunications of the ACM, 1968
- Programming Technique: An improved hash code for scatter storageCommunications of the ACM, 1968