Comparison of synonym handling and bucket organization methods
- 1 September 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 24 (9) , 579-583
- https://doi.org/10.1145/358746.358760
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.Keywords
This publication has 4 references indexed in Scilit:
- Comparison of different disk searching methodsSoftware: Practice and Experience, 1978
- General performance analysis of key-to-address transformation methods using an abstract file conceptCommunications of the ACM, 1973
- Key-to-address transform techniquesCommunications of the ACM, 1971
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957