Performance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost
Computer Science Journal of Moldova · 2026-05 · 34 (1) · 131-155
DOI: 10.56415/csjm.v34.06 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science Journal of Moldova, 2026-05. Verfasst von Rajeev Ranjan Kumar Tripathi und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Tripathi, R. R. K., Singh, P. K., & Singh, S. (2026). Performance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost. Computer Science Journal of Moldova, 34(1), 131-155. https://doi.org/10.56415/csjm.v34.06
Vancouver
Tripathi RRK, Singh PK, Singh S. Performance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost. Computer Science Journal of Moldova. 2026;34(1):131-155. doi:10.56415/csjm.v34.06
BibTeX
@article{Tripathi2026,
author = {Tripathi, Rajeev Ranjan Kumar and Singh, Pradeep Kumar and Singh, Sarvpal},
title = {Performance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost},
journal = {Computer Science Journal of Moldova},
year = {2026},
volume = {34},
number = {1},
pages = {131--155},
doi = {10.56415/csjm.v34.06}
}
EUVIMED