Th QuoteRef: mullJK8

QuoteRef: mullJK8_1983

topics > all references > ThesaHelp: references m-o

ThesaHelp:
ACM references m-z
ThesaHelp:
references m-o
Topic:
hash filter
Topic:
probability

Reference

Mullin, J.K., "A second look at bloom filters", Communications of the ACM, 26, 8, pp. 570-571, August 1983. Google

Quotations

571 ;;Quote: gives probability of unset bits in a Bloom filter

571 ;;Quote: instead of using multiple hash values in a Bloom filter, use a partitioned bit vector; easier monitoring and no performance difference

Related Topics

ThesaHelp: ACM references m-z (280 items)
ThesaHelp: references m-o (268 items)
Topic: hash filter (18 items)
Topic: probability (21 items)