More Analysis of Double Hashing for Balanced Allocations [article]

Michael Mitzenmacher
<span title="2015-03-02">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
With double hashing, for a key x, one generates two hash values f(x) and g(x), and then uses combinations (f(x) +i g(x)) n for i=0,1,2,... to generate multiple hash values in the range [0,n-1] from the initial two. For balanced allocations, keys are hashed into a hash table where each bucket can hold multiple keys, and each key is placed in the least loaded of d choices. It has been shown previously that asymptotically the performance of double hashing and fully random hashing is the same in
more &raquo; ... balanced allocation paradigm using fluid limit methods. Here we extend a coupling argument used by Lueker and Molodowitch to show that double hashing and ideal uniform hashing are asymptotically equivalent in the setting of open address hash tables to the balanced allocation setting, providing further insight into this phenomenon. We also discuss the potential for and bottlenecks limiting the use this approach for other multiple choice hashing schemes.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1503.00658v1</a> <a target="_blank" rel="external noopener" href="">fatcat:mkolh6dtvzbs3hdiakyrn4rstm</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" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>