Proactive re-optimization

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2005, Pages 107-118

  Babu, Shivnath ^a   Bizarro, Pedro ^b   DeWitt, David ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX QUERIES; DATA DISTRIBUTIONS; RE-OPTIMIZATION;

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; ESTIMATION; LARGE SCALE SYSTEMS; LOGIC DESIGN; OPTIMIZATION; STATISTICAL METHODS;

QUERY LANGUAGES;

EID: 29844441228     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066171     Document Type: Conference Paper

References (27)

1. S. Acharya et al. Join Synopses for Approximate Query Answering. In Proc. of the 1999 ACM SIGMOD Intl. Conf. on Management of Data, June 1999.
2. R. Avnur and J. Hellerstein. Eddies: Continuously Adaptive Query Processing. In Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data, May 2000.
3. B. Babcock and S. Chaudhuri. Towards a Robust Query Optimizer: A Principled and Practical Approach. In Proc. of the 2005 ACM SIGMOD Intl. Conf. on Management of Data, June 2005.
4. S. Babu and P. Bizarro. Adaptive Query Processing in the Looking Glass. In Proc. of Second Biennial Conf. on Innovative Data Systems Research (CIDR), Jan. 2005.
5. H. Brönnimann et al. Efficient data reduction with EASE. In Proc. of the Ninth ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, Aug. 2003.
6. S. Chaudhuri, R. Motwani, and V. Narasayya. On Random Sampling over Joins. In Proc. of the 1999 ACM SIGMOD Intl. Conf. on Management of Data, June 1999.
7. S. Chaudhuri, V. Narasayya, and R. Ramamurthy. Estimating Progress of Long Running SQL Queries. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, June 2004.
8. S. Christodoulakis. Implications of Certain Assumptions in Database Performance Evaluation. ACM Trans. on Database Systems, 9(2): 163-186, 1984.
9. F. Chu, J. Halpern, and P. Seshadri. Least Expected Cost Query Optimization: An Exercise in Utility. In Proc. of the 1999 ACM Symp. on the Principles of Database Systems, May 1999.
10. P. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. ACM Trans. on Database Systems, 27(3): 261-298, 2002.
11. G. Graefe and K. Ward. Dynamic Query Evaluation Plans. In Proc. of the 1989 ACM SIGMOD Intl. Conf. on Management of Data, May 1989.
12. J. Hellerstein, R. Avnur, and V. Raman. Informix Under CONTROL: Online Query Processing. Data Mining and Knowledge Discovery Journal, 4(4), Oct. 2000.
13. A. Hulgeri and S. Sudarshan. AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions. In Proc. of the 2003 ACM SIGMOD Intl. Conf. on Management of Data, Jun. 2003.
14. Y. loannidis and S. Christodoulakis. On the Propagation of Errors in the Size of Join Results. In Proc. of the 1991 ACM SIGMOD Intl. Conf. on Management of Data, May 1991.
15. Y. Ioannidis et al. Parametric Query Optimization. In Proc. of the 1992 Intl. Conf. on Very Large Data Bases, Aug. 1992.
16. Z. Ives et al. An Adaptive Query Execution System for Data Integration. In Proc. of the 1999 ACM SIGMOD Intl. Conf. on Management of Data, June 1999.
17. Z. Ives, A. Halevy, and D. Weld. Adapting to Source Properties in Processing Data Integration Queries. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, June 2004.
18. N. Kabra and D. DeWitt. Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans. In Proc. of the 1998 ACM SIGMOD Intl. Conf. on Management of Data, June 1998.
19. M. Kitsuregawa, M. Nakayama, and M. Takagi. The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method. In Proc. of the 1989 Intl. Conf. on Very Large Data Bases, Aug. 1989.
20. V. Markl et al. Robust Query Processing through Progressive Optimization. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, June 2004.
21. H. Paques, L. Liu, and C. Pu. Distributed Query Adaptation and Its Trade-offs. In Proc. of 2003 ACM Symp. on Applied Computing, March 2003.
22. V. Poosala et al. Improved Histograms for Selectivity Estimation of Range Predicates. In Proc. of the 1996 ACM SIGMOD Intl. Conf. on Management of Data, June 1996.
23. P. Selinger et al. Access Path Selection in a Relational Database Management System. In Proc. of the 1979 ACM SIGMOD Intl. Conf. on Management of Data, May 1979.
24. P. Seshadri. Predator: A Resource for Database Research. SIGMOD Record, 27(1): 16-20, 1998.
25. P. Tucker et al. Exploiting Punctuation Semantics in Continuous Data Streams. Transactions on Knowledge and Data Engineering, 15(3): 555-568, 2003.
26. T. Urhan, M. Franklin, and L. Amsaleg. Cost Based Query Scrambling for Initial Delays. In Proc. of the 1998 ACM SIGMOD Intl. Conf. on Management of Data, June 1998.
27. S. Viglas. Novel Query Optimization and Evaluation Techniques, Ph.D. Thesis, Department of Computer Sciences, University of Wisconsin-Madison, Jun 2003.