Map
Index
Random
Help
th

Quote: gives probability of unset bits in a Bloom filter

topics > all references > references m-o > QuoteRef: mullJK8_1983 , p. 571



Topic:
hash filter
Topic:
probability

Quotation Skeleton

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-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

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

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.