Improved exponential hashing

Wenbin Luo, Gregory L. Heileman
<span title="">2004</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="" style="color: black;">IEICE Electronics Express</a> </i> &nbsp;
A new and efficient open addressing technique, called improved exponential hashing, is proposed. We show that improved exponential hashing has the ability to spread table elements more randomly than the widely used double hashing, and at the same time produces full length probe sequences on all table elements. We demonstrate experimentally that improved exponential hashing performs significantly better than double hashing for clustered data. Also, some theoretic analysis is provided along with the experimental results.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1587/elex.1.150</a> <a target="_blank" rel="external noopener" href="">fatcat:2ynh3urcurbc7mcb5fdyx3jfbi</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / </button> </a>