Thumbnail
Access Restriction
Subscribed

Author Vitter, Jeffrey Scott
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Secondary storage ♦ Databases ♦ Assembly language ♦ Coalsced hashing ♦ Coalesced hashing ♦ Deletion ♦ Hashing ♦ Data structures ♦ Analysis of algorithms ♦ Asymptotic analysis ♦ Average-case ♦ Optimization
Abstract The coalesced hashing method is one of the faster searching methods known today. This paper is a practical study of coalesced hashing for use by those who intend to implement or further study the algorithm. Techniques are developed for tuning an important parameter that relates the sizes of the address region and the cellar in order to optimize the average running times of different implementations. A value for the parameter is reported that works well in most cases. Detailed graphs explain how the parameter can be tuned further to meet specific needs. The resulting tuned algorithm outperforms several well-known methods including standard coalesced hashing, separate (or direct) chaining, linear probing, and double hashing. A variety of related methods are also analyzed including deletion algorithms, a new and improved insertion strategy called varied-insertion, and applications to external searching on secondary storage devices.
Description Affiliation: Brown Univ., Providence, RI (Vitter, Jeffrey Scott)
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 25
Issue Number 12
Page Count 16
Starting Page 911
Ending Page 926


Open content in new tab

   Open content in new tab
Source: ACM Digital Library