Thumbnail
Access Restriction
Subscribed

Author Bell, James R. ♦ Kaman, Charles H.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Symbol table ♦ Table ♦ Calculated address ♦ Keys ♦ Search ♦ Hash code ♦ Hashing ♦ Lookup ♦ Scatter storage
Abstract A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance data and implementation hints are also given.
Description Affiliation: Digital Equipment Corp., Maynard (Bell, James R.; Kaman, Charles H.)
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 11
Page Count 2
Starting Page 675
Ending Page 676


Open content in new tab

   Open content in new tab
Source: ACM Digital Library