Minimizing communication cost in distributed multi-query processing

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 772-783

  Li, Jian ^a   Deshpande, Amol ^a   Khuller, Samir ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COST; COMMUNICATION NETWORKS; COMPUTING ENVIRONMENTS; DATA MOVEMENTS; DISTRIBUTED COMMUNICATIONS; DISTRIBUTED MONITORING; DISTRIBUTED QUERY PROCESSING; EFFICIENT APPROXIMATION ALGORITHMS; EXPERIMENTAL STUDIES; NOVEL ALGORITHM; NP-HARD; OPTIMAL DATA; PROCESSING PROBLEMS; STEINER TREE PROBLEM; SYNTHETIC DATASETS;

COMMUNICATION; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; QUERY PROCESSING; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 67649661838     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.85     Document Type: Conference Paper

References (37)

1. A. S. Szalay, J. Gray, A. R. Thakar, P. Z. Kunszt, T. Malik, J. Raddick, C. Stoughton, and J. vandenBerg, "The SDSS skyserver: public access to the Sloan digital sky server data," in SIGMOD, 2002, pp. 570 -581.
2. T. Malik, A. S. Szalay, T. Budavari, and A. Thakar, "Skyquery: A web service approach to federate databases," in CIDR, 2003.
3. D. T. Liu and M. J. Franklin, "The design of griddb: A data-centric overlay for the scientific grid," in VLDB, 2004, pp. 600 -611.
4. X. Wang, R. Burns, A. Terzis, and A. Deshpande, "Network-aware join processing in global-scale database federations," in ICDE, 2008.
5. P. Pietzuch, J. Ledlie, J. Shneidman, M. Roussopoulos, M. Welsh, and M. Seltzer, "Network-aware operator placement for stream-processing systems," in ICDE, 2006, p. 49.
6. M. Cherniack, H. Balakrishnan, M. Balazinska, D. Carney, U. Cetintemel, Y. Xing, and S. Zdonik, "Scalable distributed stream processing," in Conference on Innovative Data Systems Research (CIDR), 2003.
7. N. Trigoni, Y. Yao, A. J. Demers, J. Gehrke, and R. Rajaraman, "Multiquery optimization for sensor networks," in DCOSS, 2005, pp. 307 -321.
8. A. Silberstein and J. Yang, "Many-to-many aggregation for sensor networks," in ICDE, 2007.
9. W. Hong and M. Stonebraker, "Optimization of parallel query execution plans in XPRS," Distributed and Parallel Databases, vol. 1(1), 1993.
10. Q. Zhu, "Query optimization in multidatabase systems," in CASCON '92: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research. IBM Press, 1992, pp. 111 -127.
11. A. Deshpande and J. M. Hellerstein, "Decoupled query optimization for federated database systems," in ICDE, 2002, pp. 716 -732.
12. M. N. Garofalakis and Y. E. Ioannidis, "Parallel query scheduling and optimization with time- and space-shared resources," in VLDB, 1997.
13. D. Kossman, "The state of the art in distributed query processing," ACM Computing Surveys, September 2000.
14. 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)," TODS, vol. 6, no. 4, 1981.
15. R. S. Epstein, M. Stonebraker, and E. Wong, "Distributed query processing in a relational data base system," in SIGMOD, 1978.
16. C. Evrendilek, A. Dogac, S. Nural, and F. Ozcan, "Multidatabase query optimization," Distributed and Parallel Databases, 1997.
17. S. Salza, G. Barone, and T. Morzy, "Distributed query optimization in loosely coupled multidatabase systems," in ICDT, 1995.
18. C. T. Yu, Z. M. Ozsoyoglu, and K. Lam, "Optimization of distributedtree queries," JCSS, 1984.
19. D. Shasha and T.-L. Wang, ""Optimizing Equijoin Queries in Distributed Databases Where Relations Are Hash Partitioned"," TODS, vol. 16, no. 2, pp. 279 -308, June 1991.
20. T. K. Sellis, "Multiple-query optimization," ACM Trans. Database Syst., vol. 13, no. 1, pp. 23 -52, 1988.
21. P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobe, "Efficient and extensible algorithms for multi query optimization," in SIGMOD, 2000.
22. S. Ganguly, W. Hasan, and R. Krishnamurthy, "Query optimization for parallel execution," in SIGMOD, 1992, pp. 9 -18.
23. W. Hasan and R. Motwani, "Coloring away communication in parallel query optimization," in VLDB, 1995.
24. C. Chekuri,W. Hasan, and R. Motwani, "Scheduling problems in parallel query optimization," in PODS, 1995, pp. 255 -265.
25. Y. Huang and H. Garcia-Molina, "Publish/subscribe tree construction in wireless ad-hoc networks," in MDM, 2003.
26. S. Banerjee, A. Misra, J. Yeo, and A. Agrawala, "Energy-efficient broadcast and multicast trees for reliable wireless communication," Wireless Communications and Networking (WCNC), 2003.
27. O. Papaemmanouil and U. Cetintemel, "Semcast: Semantic multicast for content-based data dissemination," in ICDE, 2005.
28. G. Robins and A. Zelikovsky, "Improved Steiner tree approximation in graphs," in SODA, 2000.
29. A. Zelikovsky, "An 11/6-approximation algorithm for the network steiner problem," Algorithmica, vol. 9, no. 5, pp. 463 -470, 1993.
30. F. Eisenbrand, F. Grandoni, T. Rothvoss, and G. Schafer, "Approximating connected facility loccation problems via random facility sampling and core detoruring," in SODA, 2008, pp. 1174 -1183.
31. A. Gupta, A. Kumar, and T. Roughgarden, "Simpler and better approximation algorithms for network design," in STOC, 2003, pp. 365 -374.
32. J. Li, A. Deshpande, and S. Khuller, "Minimizing communication cost in distributed multi-query processing," University of Maryland, Technical Report CS-TR-4925, 2008.
33. Y. Bartal, "On approximating arbitrary metrices by tree metrics," in STOC, 1998, pp. 161 -168.
34. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," in STOC, 2003, pp. 448 -455.
35. T. C. Hu and K. Moerder, "Multiterminal Flows in a Hypergraph," VLSI Circuit Layout: Theory and Design, pp. 87 -93, 1985.
36. V. Chvatal, Linear Programming. W. H. Freeman, 1983.
37. D. West, Introduction to Graph Theory (2nd Ed.). Prentice Hall, 2000.