A new analysis of the false positive rate of a Bloom filter☆
References (9)
- et al.
On the false-positive rate of Bloom filters
Information Processing Letters
(2008) Space/time tradeoffs in hash coding with allowable errors
Communications of the ACM
(1970)- et al.
Network applications of Bloom filters: a survey
Internet Mathematics
(2004) - et al.
Bigtable: a distributed storage system for structured data
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This material is based on work supported by the National Science Foundation under CNS-0520081.
- 1
Miguel Jimeno is on leave from Universidad del Norte, Barranquila, Colombia.
Copyright © 2010 Elsevier B.V. Published by Elsevier B.V. All rights reserved.