Performance of Linear and Spiral Hashing Algorithms

Autor:	Arockia David Roy Kulandai, Thomas Schwarz
Jazyk:	angličtina
Rok vydání:	2024
Předmět:	linear hashing spiral hashing key-value store data structures Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
Zdroj:	Algorithms, Vol 17, Iss 9, p 401 (2024)
Druh dokumentu:	article
ISSN:	1999-4893
DOI:	10.3390/a17090401
Popis:	Linear Hashing is an important algorithm for many key-value stores in main memory. Spiral Storage was invented to overcome the poor fringe behavior of Linear Hashing, but after an influential study by Larson, it seems to have been discarded. Since almost 50 years have passed, we repeat Larson’s comparison with the in-memory implementation of both to see whether his verdict still stands. Our study shows that Spiral Storage has slightly better lookup performance but slightly poorer insert performance. However, Spiral Hashing has more predictable performance for inserts and, in particular, better fringe behavior.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/e3c0cf9fba2d4ee7b0eb162debb4f55d Zobrazit plný text záznamu View record in DOAJ Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.