Thumbnail
Access Restriction
Subscribed

Author Luccio, Fabrizio
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Weighted increment search ♦ Hash addresss ♦ Linear search ♦ Search length ♦ Clustering ♦ Hash table ♦ Key ♦ Scatter storage
Abstract A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2r. It allows full table searching, and practically eliminates primary clustering at a very low cost.
Description Affiliation: Univ. of Pisa, Pisa, Italy (Luccio, Fabrizio)
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 15
Issue Number 12
Page Count 3
Starting Page 1045
Ending Page 1047


Open content in new tab

   Open content in new tab
Source: ACM Digital Library