An analysis of average search cost of the external hashing with separate chain

Authors:
Ningping Sun;Ryozo Nakamura;Hongbing Zhu;Akio Tada;Wenling Sun
Affiliations:
Department of Information and Computer Science, Kumamoto National College of Technology, Nishigoshi, Kikuchi, Kumamoto, Japan;Kumamoto University, Japan;Hiroshima Kokusai Gakuin University, Japan;Sojo University, Japan;Central University for Nationalities, China
Venue:
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
Year:
2004

Citing 3
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Data Structures and Algorithms

Data Structures and Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

External hashing with separate chain algorithm is a well-known method to dealing with the collision problem when hashing technique is employed. The performance of external hashing with separate chain depends on the data structure of separate chain. We provide an approach to clarify the relationship between the insertion order of keys and position that key is located. Introducing the probability distribution of frequency of access to each individual key in the separate chain into the analysis of search cost, we propose a mathematical analysis to analyze and evaluate the performance of external hashing with separate chain for two cases. Some experimental results obtained from the proposed formulae are also presented.