Performance of Linear and Spiral Hashing Algorithms

Author:

Kulandai Arockia David Roy1ORCID,Schwarz Thomas1ORCID

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.

Publisher

MDPI AG

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3