Quote: avoid MOD operations within the iteration part of a Bloom filter

Quotation Skeleton

[Problem that Bloom filters typically occupy 2^n bits because MOD is otherwise too slow] The first observation is that the range … the most important MOD operations to optimize are … In the triple hashing case, we can … eliminate the MOD for y := y+z altogether … [and] speed up the MOD for x := …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash filter (18 items)