Scalable Bloom Filters

Information Processing Letters

Volumn 101, Issue 6, 2007, Pages 255-261

  Almeida, Paulo Sérgio ^a   Baquero, Carlos ^a   Preguiça, Nuno ^b   Hutchison, David ^c  

^a UNIVERSITY OF MINHO   (Portugal)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^c LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Bloom filters; Data structures; Distributed systems; Randomized algorithms

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PROBABILITY; QUERY LANGUAGES; SET THEORY;

BLOOM FILTERS; DISTRIBUTED SYSTEMS; RANDOMIZED ALGORITHMS;

STORAGE ALLOCATION (COMPUTER);

EID: 33846186007     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.10.007     Document Type: Article

References (13)

1. Bloom B.H. Space/time trade-offs in hash coding with allowable errors. Comm. ACM 13 7 (1970) 422-426
2. Chang F., Chang Feng W., and Li K. Approximate caches for packet classification. Proc. of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004) (2004), IEEE
3. Reynolds P., and Vahdat A. Efficient peer-to-peer keyword searching. In: Endler M., and Schmidt D.C. (Eds). Middleware. Lecture Notes in Computer Science vol. 2672 (2003), Springer, Berlin 21-40
4. S.C. Rhea, J. Kubiatowicz, Probabilistic location and routing, in: Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), 2002
5. Fan L., Cao P., Almeida J., and Broder A.Z. Summary cache: A scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Networks 8 3 (2000) 281-293
6. * optimizer validation and performance evaluation for distributed queries. Proceedings of the Twelfth International Conference on Very Large Data Bases (VLDB'86) (1986), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA 149-159
7. A. Broder, M. Mitzenmacher, Network applications of Bloom filters: A survey, in: Proc. of Allerton Conference, 2002
8. Cohen S., and Matias Y. Spectral Bloom filters. Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD'03) (2003), ACM Press, New York, NY, USA 241-252
9. Manber U., and Wu S. An algorithm for approximate membership checking with application to password security. Inform. Process. Lett. 50 4 (1994) 191-197
10. Dharmapurikar S., Krishnamurthy P., and Taylor D.E. Longest prefix matching using Bloom filters. Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'03) (2003), ACM Press, New York, NY, USA 201-212
11. Mitzenmacher M. Compressed Bloom filters. IEEE/ACM Trans. Networks 10 5 (2002) 604-612
12. Chazelle B., Kilian J., Rubinfeld R., and Tal A. The Bloomier filter: an efficient data structure for static support lookup tables. SODA'04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2004), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 30-39
13. Bose P., Guo H., Kranakis E., Maheshwari A., Morin P., Morrison J., Smid M., and Tang Y. On the false-positive rate of Bloom filters. Inform. Process. Lett. (2004). http://citeseer.ist.psu.edu/649161.html Available at