2006 | OriginalPaper | Buchkapitel
Less Hashing, Same Performance: Building a Better Bloom Filter
verfasst von : Adam Kirsch, Michael Mitzenmacher
Erschienen in: Algorithms – ESA 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A standard technique from the hashing literature is to use two hash functions
h
1
(
x
) and
h
2
(
x
) to simulate additional hash functions of the form
g
i
(
x
) =
h
1
(
x
) +
ih
2
(
x
). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifically, only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptotic false positive probability. This leads to less computation and potentially less need for randomness in practice.