Tony Finch – Some notes on Bloom filters : more good Bloom Filter tips. he says: ‘I take a slightly different tack, starting with a target population in mind which determines the size of the filter. Also there’s a minor error regarding performance in the corte.si post. You only need to calculate two hash functions, and use a linear combination of them to index the Bloom filter. This simplifies the coding a lot, and if hash calculation dominates filter indexing, it’s also a lot faster.’
(tags: bloom-filters tips coding via:fanf false-positives)