Boost logo

Boost :

Subject: Re: [boost] Interest in a Bloom Filter?
From: Milosz Marian HULBOJ (mhulboj_at_[hidden])
Date: 2009-06-17 05:48:31


> D partitioned bloom filters, combinations of above, other?

I think it would be also nice to have the mentioned previously
partitioned cache-aware bloom filters. I haven't got time to try out
their performance/efficiency, but the paper seems interesting:
http://algo2.iti.uni-karlsruhe.de/singler/publications/cacheefficientbloomfilters-wea2007.pdf
Implementation doesn't seem problematic.

There are plenty of possible perfomance-related quirks/variants in this
relatively simple data-structure, as in most applications the sole
reason for using bloom filters is the performance.

Regards,
Milosz


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk