Hi, Alexandre, You should have no problem using the bitvector class to store the bitmaps used for Bloom filters. You might have to be creative in order to get good performance though.
John PS: There is an approximate bitmap index published a few years back <http://www.cse.ohio-state.edu/~hakan/publications/VLDB06.pdf>. You might want to check it out. On 10/16/2010 4:08 PM, Alexandre Maurel wrote: > A Bloom filter is generated using on a hash function that ("probably") > generate a "random patern" in the bitvector, which decrease the power > of the fastbit compression scheme. > > Is there any benefit to use Fastbit compression scheme in such context ? > _______________________________________________ > FastBit-users mailing list > [email protected] > https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users _______________________________________________ FastBit-users mailing list [email protected] https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users
