Improving distributed join efficiency with extended bloom filter operations

Proceedings - International Conference on Advanced Information Networking and Applications, AINA

Volumn , Issue , 2007, Pages 187-194

  Michael, Loizos ^a   Nejdl, Wolfgang ^b   Papapetrou, Odysseas ^b   Siberski, Wolf ^b  

^a HARVARD UNIVERSITY   (United States)

^b L3S RESEARCH CENTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; WAVE FILTERS;

BLOOM FILTER; COMMUNICATION COSTS; JOIN COMPUTATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548799148     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2007.80     Document Type: Conference Paper

References (23)

1. E. Babb. Implementing a relational database by means of specialized hardware. ACM Trans. Database Syst., 4(1):1-29, 1979.
2. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Improving collection selection with overlap awareness in p2p search engines. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 67-74, 2005.
3. P. A. Bernstein, N. Goodman, E. Wong, C. L. Reeve, and J. B. R. Jr. Query processing in a system for distributed databases (sdd-1). ACM Trans. Database Syst., 6(4):602-625, 1981.
4. B.H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
5. K. Bratbergsengen. Hashing methods and relational algebra operations. In Proceedings of the Tenth International Conference on Very Large Data Bases (VLDB), pages 323-333, 1984.
6. A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. In Allerton Conference, 2002.
7. W. chang Feng, D. D. Kandlur, D. Saha, and K. G. Shin. Stochastic fair blue: A queue management algorithm for enforcing fairness. In Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1520-1529, 2001.
8. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. 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), pages 30-39, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics.
9. M.-S. Chen and P. S. Yu. Combining join and semi-join operations for distributed query processing. IEEE Trans. Knowl. Data Eng., 5(3):534-542, 1993.
10. S. Cohen and Y. Matias. Spectral bloom filters. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pages 241-252, 2003.
11. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000.
12. D. Guo, J. Wu, H. Chen, and X. Luo. 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.
13. A. Kumar, J. Xu, J. Wang, O. Spatscheck, and L. Li. 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.
14. A. Kumar, J. J. Xu, and E. W. Zegura. Efficient and scalable query routing for unstructured peer-to-peer networks. In INFOCOM, 2005.
15. Z. Li and K. A. Ross. Perf join: An alternative to two-way semijoin and bloomjoin. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), pages 137-144, 1995.
16. B. Liu and E. A. Rundensteiner. Revisiting pipelined parallelism in multi-join query processing. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pages 829-840, 2005.
17. H. Lu, K.-L. Tan, and M.-C. Shan. Hash-based join algorithms for multiprocessor computers. In 16th International Conference on Very Large Data Bases (VLDB), pages 198-209, 1990.
18. L. F. Mackert and G. M. Lohman. R* optimizer validation and performance evaluation for distributed queries. In Proceedings of the Twelfth International Conference on Very Large Data Bases (VLDB), pages 149-159, 1986.
19. M. Mitzenmacher. Compressed bloom filters. IEEE/ACM Trans. Netw., 10(5):604-612, 2002.
20. J. K. Mullin. Optimal semijoins for distributed database systems. IEEE Trans. Software Eng., 16(5):558-560, 1990.
21. D. A. Schneider and D. J. DeWitt. A performance evaluation of four parallel j oin algorithms in a shared-nothing multiprocessor environment. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 110-121, 1989.
22. D. A. Schneider and D. J. DeWitt. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In 16th International Conference on Very Large Data Bases (VLDB), pages 469-480, 1990.
23. C. Wang, A. L. P. Chen, and S.-C. Shyu. A parallel execution method for minimizing distributed query response time. IEEE Trans. Parallel Distrib. Syst., 3(3):325-333, 1992.