Cardinality estimation and dynamic length adaptation for Bloom filters

Distributed and Parallel Databases

Volumn 28, Issue 2-3, 2010, Pages 119-156

  Papapetrou, Odysseas ^a   Siberski, Wolf ^a   Nejdl, Wolfgang ^a  

^a L3S RESEARCH CENTER   (Germany)

Author keywords

Bloom filters; Distributed databases; Distributed information systems

Indexed keywords

BLOOM FILTERS; CARDINALITIES; CARDINALITY ESTIMATIONS; DISTINCT ELEMENTS; DISTRIBUTED APPLICATIONS; DISTRIBUTED DATABASE; DISTRIBUTED INFORMATION SYSTEMS; EXPERIMENTAL EVALUATION; FALSE POSITIVE; NETWORK REQUIREMENTS; NEW APPROACHES; PROBABILISTIC ANALYSIS; PROBABILISTIC BOUNDS;

DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; ENCODING (SYMBOLS); ESTIMATION; INFORMATION SYSTEMS; QUERY PROCESSING;

BLOOMS (METAL);

EID: 77957859235     PISSN: 09268782     EISSN: 15737578     Source Type: Journal    
DOI: 10.1007/s10619-010-7067-2     Document Type: Article

References (45)

1. Abiteboul, S., Manolescu, I., Polyzotis, N., Preda, N., Sun, C.: XML processing in dht networks. In: Proceedings of the 24th International Conference on Data Engineering (ICDE), pp. 606-615 (2008)
2. N. Anciaux M. Benzine L. Bouganim P. Pucheral D. Shasha 2009 Revelation on demand Distrib. Parallel Databases 25 1-2 5 28 10.1007/s10619-009-7035-x
3. Artan, N.S., Sinkar, K., Patel, J., Chao, H.J.: Aggregated bloom filters for intrusion detection and prevention hardware. In: Proceedings of the Global Communications Conference (GLOBECOM), pp. 349-354 (2007)
4. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM'02), pp. 1-10 (2002)
5. Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Improving collection selection with overlap awareness in P2P search engines. In: Proceedings of the 28th Annual International ACM Conference on Research and Development in Information Retrieval (SIGIR), pp. 67-74 (2005)
6. B.H. Bloom 1970 Space/time trade-offs in hash coding with allowable errors ACM Commun. 13 7 422 426 0195.47003 10.1145/362686.362692
7. Bratbergsengen, K.: Hashing methods and relational algebra operations. In: Proceedings of the Tenth International Conference on Very Large Data Bases (VLDB), pp. 323-333 (1984)
8. Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. In: Allerton Conference (2002)
9. J.W. Byers J. Considine M. Mitzenmacher S. Rost 2004 Informed content delivery across adaptive overlay networks IEEE/ACM Trans. Netw. 12 5 767 780 10.1109/TNET.2004.836103
10. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 30-39 (2004)
11. Chervenak, A.L., Deelman, E., Foster, I.T., Guy, L., Hoschek, W., Iamnitchi, A., Kesselman, C., Kunszt, P.Z., Ripeanu, M., Schwartzkopf, R., Stockinger, H., Stockinger, K., Tierney, B.: Giggle: a framework for constructing scalable replica location services. In: Proceedings of the 2002 ACM/IEEE Conference on Supercomputing, pp. 1-17 (2002)
12. Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 241-252 (2003)
13. Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities. In: Twelfth IEEE International Symposium on High Performance Distributed Computing (HPDC-12), June 2003
14. O. Erdogan P. Cao 2007 Hash-av: fast virus signature scanning by cache-resident filters Int. J. Security Netw. 2 1/2 50 59 10.1504/IJSN.2007. 012824
15. L. Fan P. Cao J.M. Almeida A.Z. Broder 2000 Summary cache: a scalable wide-area web cache sharing protocol IEEE/ACM Trans. Netw. 8 3 281 293 10.1109/90.851975
16. P. Flajolet G.N. Martin 1985 Probabilistic counting algorithms for data base applications J. Comput. Syst. Sci. 31 2 182 209 0583.68059 10.1016/0022-0000(85)90041-8 828521
17. Guo, D., Wu, J., Chen, H., Luo, X.: Theory and network applications of dynamic bloom filters. In: Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2006)
18. Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. Trans. Knowl. Data Eng., 22(1) 2010
19. Hao, F., Kodialam, M.S., Lakshman, T.V.: Incremental bloom filters. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), pp. 1067-1075 (2008)
20. Koloniari, G., Petrakis, Y., Pitoura, E.: Content-based overlay networks of XML peers based on multi-level bloom filters. In: Proceedings of VLDB International Workshop on Databases, Information Systems and Peer-to-Peer Computing, pp. 232-247. Springer, Berlin (2003) (Pubitemid 39741266)
21. Koloniari, G., Pitoura, E.: Content-based routing of path queries in peer-to-peer systems. In: Proceedings of International Conference on Extending Database Technology (EDBT), pp. 29-47 (2004)
22. Koloniari, G., Pitoura, E.: Distributed structural relaxation of xpath queries. In: Proceedings of the 25th International Conference on Data Engineering (ICDE), pp. 529-540 (2009)
23. D. Kossmann 2000 The state of the art in distributed query processing ACM Comput. Surv. 32 4 422 469 10.1145/371578.371598
24. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S.E., Eaton, P.R., Geels, D., Gummadi, R., Rhea, S.C., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.Y.: Oceanstore: an architecture for global-scale persistent storage. In: Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 190-201, Cambridge, MA, USA (2000)
25. Kumar, A., Xu, J., Wang, J., Spatscheck, O., Li, L.: Space-code bloom filter for efficient per-flow traffic measurement. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2004)
26. Kumar, A., Xu, J.(J.), Zegura, E.W.: Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings of the 24rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2005)
27. Mackert, L.F., Lohman, G.M.: Roptimizer validation and performance evaluation for distributed queries. In: Proceedings of the Twelfth International Conference on Very Large Data Bases (VLDB), pp. 149-159 (1986)
28. Metwally, A., Agrawal, D., El Abbadi, A.: Duplicate detection in click streams. In: Proceedings of the 14th International Conference on World Wide Web (WWW'05), pp. 12-21. ACM, New York (2005)
29. Michael, L., Nejdl, W., Papapetrou, O., Siberski, W.: Improving distributed join efficiency with extended bloom filter operations. In: Proceedings of 21st International Conference on Advanced Information Networking and Applications (AINA), pp. 187-194 (2007)
30. Michel, S., Triantafillou, P., Weikum, G.: KLEE: a framework for distributed top-k query algorithms. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pp. 637-648 (2005)
31. M. Mitzenmacher 2002 Compressed bloom filters IEEE/ACM Trans. Netw. 10 5 604 612 10.1109/TNET.2002.803864 (Pubitemid 35312139)
32. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (2000)
33. J.K. Mullin 1990 Optimal semijoins for distributed database systems IEEE Trans. Softw. Eng. 16 5 558 560 10.1109/32.52778 (Pubitemid 20712732)
34. Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. 1(2) (2005)
35. T. Neumann M. Bender S. Michel R. Schenkel P. Triantafillou G. Weikum 2009 Distributed top-k aggregation queries at large Distrib. Parallel Databases 26 1 3 27 10.1007/s10619-009-7041-z
36. Ramesh, S., Papapetrou, O., Siberski, W.: Optimizing distributed joins with bloom filters. In: Proceedings of International Conference of Distributed Computing and Internet Technology (ICDCIT) (2008)
37. Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Middleware '03: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware, pp. 21-40. Springer, New York (2003)
38. Rhea, S.C., Kubiatowicz, J.: Probabilistic location and routing. In: INFOCOM (2002)
39. E. Safi A. Moshovos A.G. Veneris 2008 L-CBF: A low-power, fast counting bloom filter architecture IEEE Trans. Very Large Scale Integration (VLSI) Syst. 16 6 628 638 10.1109/TVLSI.2008.2000244 (Pubitemid 351720882)
40. Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: SPIE/ACM Conference on Multimedia Computing and Networking (MMCN) (2002)
41. Snoeren, A.C.: Hash-based ip traceback. In: SIGCOMM, pp. 3-14 (2001)
42. Song, H., Sproull, T.S., Attig, M., Lockwood, J.W.: Snort offloader: A reconfigurable hardware NIDS filter. In: Proceedings of the International Conference on Field Programmable Logic and Applications (FPL), pp. 493-498 (2005)
43. Wang, W., Jiang, H., Lu, H., Yu, J.X.: Bloom histogram: path selectivity estimation for XML data with updates. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB), pp. 240-251 (2004)
44. Yan, J., Cho, P.L.: Enhancing collaborative spam detection with bloom filters. In: Computer Security Applications Conference, Annual, pp. 414-428 (2006)
45. R. Zhou K. Hwang M. Cai 2008 Gossiptrust for fast reputation aggregation in peer-to-peer networks IEEE Trans. Knowl. Data Eng. 20 9 1282 1295 10.1109/TKDE.2008.48