Full Table Quadratic Searching for Scatter Storage 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 4n+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. CACM August, 1970 Day, A. C. quadratic residue, search method, hash tables, scatter storage, dictionary look-up, quadratic search, searching, hashing, hash code, clustering, collisions 3.7 3.73 3.74 CA700803 JB February 10, 1978 3:57 PM 1676 4 2018 1682 4 2018 1728 4 2018 1860 4 2018 1860 4 2018 1973 4 2018 1973 4 2018 1973 4 2018 1992 4 2018 2018 4 2018 2018 4 2018 2018 4 2018 2032 4 2018 2033 4 2018 2033 4 2018 2107 4 2018 2107 4 2018 2109 4 2018 2109 4 2018 2203 4 2018 2203 4 2018 2203 4 2018 2251 4 2018 2251 4 2018 2251 4 2018 2359 4 2018 2524 4 2018 2543 4 2018 2543 4 2018 2543 4 2018 2552 4 2018 2559 4 2018 2573 4 2018 2770 4 2018 2770 4 2018 2974 4 2018 2991 4 2018 3053 4 2018 3053 4 2018 1785 5 2018 1786 5 2018 2018 5 2018 2018 5 2018 2018 5 2018 2109 5 2018 2251 5 2018 2573 5 2018 2770 5 2018 1785 6 2018 1786 6 2018 1786 6 2018 1786 6 2018 1869 6 2018 1973 6 2018 1973 6 2018 1992 6 2018 2018 6 2018 2018 6 2018 2018 6 2018 2107 6 2018 2107 6 2018 2109 6 2018 2109 6 2018 2673 6 2018