/bloom-filter

Elixir implementation of probabilistic data structure BloomFilter for quick searches.

Primary LanguageElixir

BloomFilter

Elixir implementation of Bloom Filter for quick probabilistic searches. The data structure can quickly make a guess whether an item probably exists in the set or not. Result may be a false positive but it is never a false negative. The probability of getting a false positive can be controlled by selecting sufficient size of bit array.

Installation

If available in Hex, the package can be installed by adding bloom_filter to your list of dependencies in mix.exs:

def deps do
  [
    {:bloom_filter, "~> 0.1.0"}
  ]
end

Documentation can be generated with ExDoc and published on HexDocs. Once published, the docs can be found at https://hexdocs.pm/bloom_filter.