Incremental Bloom filters

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1741-1749

  Fang, Hao ^a   Kodialam, Murali ^a   Lakshman, T V ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES;

BLOOM FILTERING;

WAVE FILTERS;

EID: 51349108838     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.161     Document Type: Conference Paper

References (14)

1. B. H. Bloom, "Space/time tradeoffs in hash coding with allowable errors", Communications of the ACM 13:7 (1970), 422-426.
2. K. Bratbergsengen, "Hashing Methods and Relational Algebra Operations". In Proceedings of the Tenth International Conference on Very Large Databases, pp. 323-333. San Francisco. Morgan Kaufmann, 1984.
3. J. K. Mullin, "Optimal Semijoins for Distributed Database Systems", IEEE Transactions on Software Engineering 16:5 (1990), 558.
4. M. Mitzenmacher, "Compressed Bloom filters", IEEE/ACM Tmnsactions on Networking 10:5 (2002), 604-612.
5. A. Broder and M. Mitzenmacher, "Network applications fo Bloom filters: a survey", Internet Mathematics, vol. 1. no. 4, pp. 485-509. 2005.
6. L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary cache: a scalable wide-area web cache sharing protocol", IEEE/ACM Transactions on Networking 8:3 (2000), 281-293.
7. D. Guo, J. Wu, H. Chen, and X. Luo, "Theory and network applications of dynamic Bloom filters", Proceedings of IEEE INFOCOM, April 2006.
8. J. Wang, M. Xiao, J. Jiang, and B. Min, "i-DBF: an improved Bloom filter representation method on dynamic set", gccw, pp. 156-162, Fifth International Conference on Grid and Cooperative Computing Workshops. 2006.
9. B. Chazelle, J. Kilian, R. Rubinfeld, and A. The, "The Bloomier filter: an efficient data structure for static support lookup tables", SODA 2004.
10. "Zipf's law", http://en.wikipedia.org/wikiyZipfs_law.
11. C. Estan and G. Varghese, "New directions in traffic measurement and accounting". Proceedings of ACM SIGCOMM Conference, 2002.
12. C. Faloutsos, M. Faloutsos, and P. Faloutsos, "On power-law relationships of the Internet topology", Proc of ACM SIGCOMM, Aug. 1999.
13. E. H. Spafford, "Opus: preventing weak password choices", Computer and Security 11 (1992), 273-278.
14. U. Manber and S. Wu, "An algorithm for approximate membership checking with application to password security", Information Processing Letters 50 (1994), 191-197.