lsm-tree-0.1.0.0: Log-structured merge-trees
Safe HaskellSafe-Inferred
LanguageGHC2021

Data.BloomFilter.Calc

Description

Various formulas for working with bloomfilters.

Synopsis

Documentation

falsePositiveProb Source #

Arguments

:: Double

n, number of elements

-> Double

m, size of bloom filter

-> Double

k, number of hash functions

-> Double 

Approximate probability of false positives \[ {\displaystyle \varepsilon =\left(1-\left[1-{\frac {1}{m}}\right]^{kn}\right)^{k}\approx \left(1-e^{-kn/m}\right)^{k}} \]

>>> [ showFFloat (Just 5) (falsePositiveProb 10_000 100_000 k) "" | k <- [1..5] ]
["0.09516","0.03286","0.01741","0.01181","0.00943"]

filterSize Source #

Arguments

:: Double

n, number of elements

-> Double

e, false positive rate

-> Double

k, number of hash functions

-> Double 

Filter size for given number of elements, false positive rate and number of hash functions.