Enhancing lookup performance of key-value stores using cuckoo hashing

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.