Hello Folks, http://algo2.iti.kit.edu/documents/cacheefficientbloomfilters-jea.pdf
Looks like there are some interesting results in this paper which may be very useful for us in reducing the IO we make to load the bloom filters. This paper talks about cache misses - but we can make the same argument about random access in HDD. We may want to try this out? Thoughts? - Prasanna
