Using the Power of Two Choices to Improve Bloom Filters

DOI10.1080/15427951.2007.10129136zbMath1170.68447OpenAlexW2115297415MaRDI QIDQ3622688

Steve Lumetta, Michael Mitzenmacher

Publication date: 28 April 2009

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2007.10129136

zbMATH Keywords

hashing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (3)

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Two-way chaining for non-uniform distributions

This page was built for publication: Using the Power of Two Choices to Improve Bloom Filters