A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
With double hashing, for a key x, one generates two hash values f (x) and g(x), and then uses combinations (f (x) + ig(x)) mod 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 hashingdoi:10.1137/1.9781611974324.1 dblp:conf/analco/Mitzenmacher16 fatcat:e3cru7b3nzbdjhufehr2tbjihm