Standalone, Java implementation of Bloom Filters

I wrote an implementation of Bloom Filters which you can download from here. This implementation offers some advantages

• Pluggable hash functions
• Pluggable “bit stores” (an array of bits)
  • An option to store the bloom filter in a file on disk. This allows for bloom filters bigger than your JVM heap by using Memory Mapped Files
  • An option to store the bloom filter in ram.

Instructions for using the bloom filter are in the javadocs.

Tagged as: algorithms, hashing