An alternative analysis of the open hashing algorithm

Authors:
Ningping Sun;Ryozo Nakamura
Affiliations:
Kumamoto National College of Technology, Nishigoshi, Kikuchi, Kumamoto, Japan;Kumamoto University, Kumamoto, Japan
Venue:
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
Year:
2004

Citing 2
Cited 2

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

Digital signature and hash function irregularity

TELE-INFO'09 Proceedings of the 8th Wseas international conference on Telecommunications and informatics
Relation between successfulness of birthday attack on digital signature and hash function irregularity

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hashing is one of the most important techniques for sorting and searching. Two problems that how to design a good hash function and how to deal with the collision must be resolved when hashing is applied. First, we provide an evaluation system of hashing algorithm unsing some popular hash functions and show some evaluation results. Continuously, we present an analysis of the probability that collision occurs. Introducing the probability distribution of frequency of access on each individual key in the separate chain into the analysis of search cost, we propose a mathematical analysis to exactly analyze and evaluate the performance of open hashing algorithm. Some interesting test results obtained from the proposed formulae are also presented.