Access Restriction

Author Quittner, P. ♦ Halász, S. ♦ Csóka, S. ♦ Várnai, K. ♦ Kotsis, D.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
Language English
Subject Keyword Synonym handling ♦ Access methods ♦ Hashing ♦ File organization
Abstract A theoretical description of the access times required in open addressing and external chaining is given. Values are calculated for different record and bucket sizes and load factors, and the corresponding values for the two methods are compared. Practical guidelines for determining bucket sizes and load factors are presented. It is proved that open addressing is almost always superior to external chaining and the optimal bucket size is between 1 and 4.
Description Affiliation: Eötvös Univ., Budapest, Hungary (Quittner, P.; Csóka, S.; Halász, S.; Kotsis, D.; Várnai, K.)
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 24
Issue Number 9
Page Count 5
Starting Page 579
Ending Page 583

Open content in new tab

   Open content in new tab
Source: ACM Digital Library