Less hashing, same performance: Building a better Bloom filter
Lists
Only you see this
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...
BibTeX
@inproceedings{kirsch2006less,
author = {Adam Kirsch and Michael Mitzenmacher},
title = {{Less hashing, same performance: Building a better Bloom filter}},
booktitle = {ESA},
year = {2006},
doi = {10.1007/11841036\_42},
}Loading related content...