Thumbnail
Access Restriction
Subscribed

Author Day, A. Colin
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Search method ♦ Searching ♦ Collisions ♦ Hash code ♦ Hashing ♦ Quadratic residue ♦ Quadratic search ♦ Hash tables ♦ Clustering ♦ Dictionary look-up ♦ Scatter storage
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 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.
Description Affiliation: Univ. College London, England (Day, A. Colin)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 13
Issue Number 8
Page Count 2
Starting Page 481
Ending Page 482


Open content in new tab

   Open content in new tab
Source: ACM Digital Library