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

DOI

10.2991/ijndc.2015.3.1.7How to use a DOI?

Keywords

hash table, open addressing, closed addressing, nosql, online advertising

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.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Dapeng Liu
AU  - Shaochun Xu
PY  - 2015
DA  - 2015/01/01
TI  - Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study
JO  - International Journal of Networked and Distributed Computing
SP  - 60
EP  - 68
VL  - 3
IS  - 1
SN  - 2211-7946
UR  - https://doi.org/10.2991/ijndc.2015.3.1.7
DO  - 10.2991/ijndc.2015.3.1.7
ID  - Liu2015
ER  -