Enhancing lookup performance of key-value stores using cuckoo hashing

Authors:
Joonhyouk Jang;Yookun Cho;Jinman Jung;Gwangil Jeon
Affiliations:
Seoul National University Korea;Seoul National University Korea;Seoul National University Korea;Korea Polytechnic University Korea
Venue:
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Year:
2013

Citing 3
Cited 0

Cuckoo hashing: further analysis

Information Processing Letters
Cuckoo hashing

Journal of Algorithms
Dynamo: amazon's highly available key-value store

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, many studies have been conducted on key-value store as a platform for distributed storage services. A key-value store manages data as key-value pairs using hash tables. In this paper, we propose a hybrid hash table management technique to improve the performance of single nodes in a key-value store. The proposed scheme uses cuckoo hashing and separate chaining at the same time. Using this hybrid hashing scheme, cuckoo hashing and separate chaining offset the respective disadvantages while preserving the advantages of both. Experiments show that the proposed scheme is much faster than the hash table with separate chaining for temporal locality workloads.