Simple Summaries for Hashing with Multiple Choices

@inproceedings{Kirsch2005SimpleSF,
  title={Simple Summaries for Hashing with Multiple Choices},
  author={Adam Kirsch and Michael Mitzenmacher},
  year={2005}
}
In a multiple-choice hashing scheme, each item is stored in o ne of d ≥ 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in the maximum load of the buckets. However, a lookup may now require examin ing each of thed locations. For applications where this cost is undesirable, Song et al. pro pose keeping a summary that allows one to determine which of thed locations is appropriate for each item, where the summary ma allow false positives… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
10 Extracted Citations
22 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 10 extracted citations

Similar Papers

Loading similar papers…