RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.34, n1. (100), 2026/

Performance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost

Authors: Rajeev Ranjan Kumar Tripathi, Pradeep Kumar Singh, Sarvpal Singh
Keywords: Symmetric Sequential Cuckoo Hashing, Asymmetric Sequential Cuckoo Hashing, Degree of Dexterity, Table Reference Count per Key.

Abstract

Cuckoo Hashing has been considered the state of the art since its origin. In Cuckoo Hashing, the search operation is executed sequentially in the tables, and thus, Cuckoo Hashing is Sequential Cuckoo Hashing. Based on the size of the table, Cuckoo Hashing is implemented in two ways: Symmetric Sequential Cuckoo Hashing and Asymmetric Sequential Cuckoo Hashing. Cuckoo Hashing suffers from higher insertion latency, inefficient memory usage, and high data migration. This work investigates the performance of both versions of Cuckoo Hashing under the light of two newly proposed performance indicators: Degree of Dexterity and Table Reference Count per key.

Rajeev Ranjan Kumar Tripathi
ORCID: https://orcid.org/0000-0002-8539-6707
Institution: Madan Mohan Malaviya University of Technology, Gorakhpur
Address: Uttar Pradesh, India
E-mail:

Pradeep Kumar Singh
ORCID: https://orcid.org/0000-0002-4250-5264
Institution: Madan Mohan Malaviya University of Technology, Gorakhpur
Address: Uttar Pradesh, India
E-mail:

Sarvpal Singh
ORCID: https://orcid.org/0009-0008-1965-2064
Institution: Madan Mohan Malaviya University of Technology, Gorakhpur
Address: Uttar Pradesh, India
E-mail:

DOI

https://doi.org/10.56415/csjm.v34.06

Fulltext

Adobe PDF document0.37 Mb