Affiliation:
1. Department of Computer Science, Marquette University, Milwaukee, WI 53233, USA
Abstract
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.
Reference16 articles.
1. Dynamic hash tables;Larson;Commun. ACM,1988
2. Extendible hashing—A fast access method for dynamic files;Fagin;ACM Trans. Database Syst. (TODS),1979
3. Linear hashing: A new tool for file and table addressing;Litwin;VLDB,1980
4. Martin, G.N.N. (1979). Spiral Storage: Incrementally Augmentable Hash Addressed Storage, University of Warwick. Theory of Computation Report—CS-RR-027.
5. Spiral storage: Efficient dynamic hashing with constant performance;Mullin;Comput. J.,1985