Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study

Abstract

In this paper, we conducted empirical experiments to study the performance of hashing with a large set of data and compared the results of different collision approaches. The experiment results leaned more to closed addressing than to open addressing and deemed linear probing impractical due to its low performance. Moreover, when items are randomly distributed with keys in a large space, different hash algorithms might produce similar performance. Increasing randomness in keys does not help hash table performance either and it seems that the load factor solely determines possibility of collision. These new discoveries might help programmers to design software products using hash tables.

Verified Mutable Data Structures

“…− the performance is dropping dramatically when the occupation factor increases (above around 0.7 [2]) as the number of hops needed during the probing phase increases.…”