Article
Version 1
This version is not peer-reviewed
Performance of Linear and Spiral Hashing
Version 1
: Received: 2 July 2024 / Approved: 4 July 2024 / Online: 4 July 2024 (09:44:28 CEST)
How to cite: Kulandai, A. D. R.; Schwarz, T. J. E. Performance of Linear and Spiral Hashing. Preprints 2024, 2024070413. https://doi.org/10.20944/preprints202407.0413.v1 Kulandai, A. D. R.; Schwarz, T. J. E. Performance of Linear and Spiral Hashing. Preprints 2024, 2024070413. https://doi.org/10.20944/preprints202407.0413.v1
Abstract
Linear Hashing is an important algorithm for many key-value stores. Spiral Storage was invented to overcome the poor fringe behavior of Linear Hashing, but after an influential study by Larson, seems to have been discarded. Since almost 50 years have passed, we repeat Larson’s comparison with in-memory implementation of both to see whether his verdict still stands. Our study shows that Spiral Storage has slightly better look-up performance, but slightly poorer insert performance.
Keywords
Linear Hashing; Spiral Hashing; Key-value Store; Data Structures
Subject
Computer Science and Mathematics, Data Structures, Algorithms and Complexity
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
