OpenReview
.net
OpenReview
.net
Login
OpenReview
.net
Login
Go to
RSA 2008
homepage
Less hashing, same performance: Building a better Bloom filter
Adam Kirsch
,
Michael Mitzenmacher
2008 (modified: 17 Sept 2020)
Random Struct. Algorithms 2008
Readers:
Everyone
Abstract:
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstrate that this techni...
0 Replies
Loading