Comparison of synonym handling and bucket organization methods

Authors:
P. Quittner;S. Csóka;S. Halász;D. Kotsis;K. Várnai
Affiliations:
Eötvös Univ., Budapest, Hungary;Eötvös Univ., Budapest, Hungary;Eötvös Univ., Budapest, Hungary;Eötvös Univ., Budapest, Hungary;Eötvös Univ., Budapest, Hungary
Venue:
Communications of the ACM
Year:
1981

Citing 4
Cited 4

General performance analysis of key-to-address transformation methods using an abstract file concept

Communications of the ACM
Key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM
Computer Database Organization, 2nd Ed

Computer Database Organization, 2nd Ed
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

A compendium of key search references

ACM SIGIR Forum
The average time until bucket overflow

ACM Transactions on Database Systems (TODS)
Query-processing optimization strategies: feasible vs optimal solutions

ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Hash table methods for case statements

ACM-SE 20 Proceedings of the 20th annual Southeast regional conference

Quantified Score

Hi-index	48.22

Visualization

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.