The probability of any bit remaining unset [in a Bloom filter] is just the probability that each of the mk transformations … Thus Pallset = [1-(1- 1/N)^mk]^m [where N= number of bits in the filter, m= number of transformations made, k= number of different records modified]
Google-1Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash filter (18 items)
Topic: probability (21 items)