Self-monitoring query execution for adaptive query processing

Data and Knowledge Engineering

Volumn 51, Issue 3, 2004, Pages 325-348

  Gounaris, Anastasios ^a   Paton, Norman W ^a   Fernandes, Alvaro A A ^a   Sakellariou, Rizos ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Adaptive query processing; Operators; Query execution; Query monitoring

Indexed keywords

COST EFFECTIVENESS; DATA REDUCTION; ESTIMATION; MATHEMATICAL OPERATORS; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

ADAPTIVE QUERY PROCESSING (AQP); QUERY EXECUTION; QUERY MONITORING;

QUERY LANGUAGES;

EID: 5144227150     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2004.05.002     Document Type: Article

References (31)

1. R. Arpaci-Dusseau, E. Anderson, N. Treuhaft, D. Culler, J. Hellerstein, D. Patterson, K. Yelick, Cluster I/O with river: making the fast case common, in: Proceedings of the Sixth Workshop on Input/Output in Parallel and Distributed Systems, 1999, pp. 10-22.
2. R. Avnur, J. Hellerstein, Eddies: continuously adaptive query processing, in: Proceedings of the ACM SIGMOD 2000, 2000, pp. 261-272.
3. L. Bouganim, F. Fabret, C. Mohan, P. Valduriez, Dynamic query scheduling in data integration systems, in: Proceedings of ICDE 2000, 2000, pp. 425-434.
4. Bruno N., Chaudhuri S. Exploiting statistics on query expressions for optimization. Proceedings of ACM SIGMOD 2002. 2002;263-274 ACM Press.
5. Carey M., DeWitt D., Naughton J. The OO7 benchmark. SIGMOD Record (ACM Special Interest Group on Management of Data). 22(2):1993;12-21.
6. S. Chandrasekaran, O. Cooper, A. Deshpande, M. Franklin, J. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, V. Raman, F. Reiss, M. Shah. TelegraphCQ: Continuous dataflow processing for an uncertain world, in: Proceedings of 2003 CIDR, 2003.
7. Chaudhuri S. An overview of query optimization in relational systems. Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington. 1998;34-43 ACM Press.
8. Foster I., Kesselman C. The Grid: Blueprint for a New Computing. 1999;Morgan Kaufmann Publishers.
9. G. Graefe, Encapsulation of parallelism in the Volcano query processing system, in: Proceedings of ACM SIGMOD 1990, 1990, pp. 102-111.
10. Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys. 25(2):1993;73-170.
11. P. Haas, J. Hellerstein, Ripple joins for online aggregation, in: Proceedings of ACM SIGMOD 1999, 1999, pp. 287-298.
12. Hellerstein J., Franklin M., Chandrasekaran S., Deshpande A., Hildrum K., Madden S., Raman V., Shah M. Adaptive query processing: technology in evolution. IEEE Data Engineering Bulletin. 23(2):2000;7-18.
13. Ioannidis Y. Query optimization. ACM Computing Surveys. 28(1):1996;121-123.
14. Y. Ioannidis, S. Christodoulakis, On the propagation of errors in the size of join results, in: Proceedings of ACM SIGMOD 1991, 1991, pp. 268-277.
15. Z. Ives, D. Florescu, M. Friedman, A. Levy, D. Weld, An adaptive query execution system for data integration, in: Proceedings of ACM SIGMOD 1999, 1999, pp. 299-310.
16. N. Kabra, D. DeWitt, Efficient mid-query re-optimization of sub-optimal query execution plans, in: Proceedings of ACM SIGMOD 1998, 1998, pp. 106-117.
17. Kossmann D. The state of the art in distributed query processing. ACM Computing Surveys. 32(4):2000;422-469.
18. Madden S., Shah M., Hellerstein J., Raman V. Continuously adaptive continuous queries over streams. Proceedings of ACM SIGMOD 2002. 2002;49-60 ACM Press.
19. Ng K., Wang Z., Muntz R., Nittel S. Dynamic query re-optimization. Proceedings of 11th SSDBM. 1999;264-273 IEEE Computer Society.
20. H. Paques, L. Liu, C. Pu, Ginga: a self-adaptive query processing system, in: Proceedings of the 11th ACM CIKM, 2002, pp. 655-658.
21. Raman J., Hellerstein V. Partial results for online query processing. Proceedings of ACM SIGMOD 2002. 2002;275-286 ACM Press.
22. Roth M., Ozcan F., Haas L. Cost models DO matter: providing cost information for diverse data sources in a federated system. Proc. of the 25th VLDB Conference. 1999;599-610 Morgan Kaufmann.
23. S. Sampaio, N.W. Paton, J. Smith, P. Watson, Validated cost models for parallel OQL query processing, in: OOIS, LNCS, Springer, 2002, pp. 60-75.
24. M. Shah, J. Hellerstein, S. Chandrasekaran, M. Franklin, Flux: an adaptive partitioning operator for continuous query systems, in: Proceedings of ICDE 2003, 2003.
25. Smith J., Gounaris A., Watson P., Paton N.W., Fernandes A.A.A., Sakellariou R. Distributed query processing on the grid. Proceedings of the Third Workshop on Grid Computing, GRID2002. 2002;279-290 Springer.
26. Stillger M., Lohman G., Markl V., Kandil M. LEO - DB2's LEarning Optimizer. Proceedings of the 27th VLDB Conference. 2001;19-28 Morgan Kaufmann.
27. F. Tian, D. DeWitt, Tuple routing strategies for distributed eddies, in: Proceedings of 29th VLDB Conference, 2003, pp. 333-344.
28. Urhan T., Franklin M. XJoin: a reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin. 23(2):2000;27-33.
29. Urhan T., Franklin M. Dynamic pipeline scheduling for improving interactive query performance. The VLDB Journal. 2001;501-510.
30. T. Urhan, M. Franklin, L. Amsaleg, Cost-based query scrambling for initial delays, in: Proceedings of ACM SIGMOD 1998, 1998, pp. 130-141.
31. Zhang W., Larson P. Dynamic memory adjustment for external mergesort. The VLDB Journal. 1997;376-385.