ABSTRACT
Query Optimization is expected to produce good execution plans for complex queries while taking relatively small optimization time. Moreover, it is expected to pick the execution plans with rather limited knowledge of data and without any additional input from the application. We argue that it is worth rethinking this prevalent model of the optimizer. Specifically, we discuss how the optimizer may benefit from leveraging rich usage data and from application input. We conclude with a call to action to further advance query optimization technology.
- Selinger, P. et.al.: Access Path Selection in a Relational Database Management System. SIGMOD 1979: 23--34 Google ScholarDigital Library
- Graefe, G.: The Cascades Framework for Query Optimization. IEEE Data Eng. Bull. 18(3): 19--29 (1995)Google Scholar
- Pirahesh, H., Hellerstein, J.M., Hasan, W.: Extensible/Rule Based Query Rewrite Optimization in Starburst. SIGMOD Conference 1992: 39--48 Google ScholarDigital Library
- Aboulnaga, A., Chaudhuri, S.: Self-tuning Histograms: Building Histograms Without Looking at Data. SIGMOD 1999: 181--192 Google ScholarDigital Library
- Srivastava, U. et.al. ISOMER: Consistent Histogram Construction Using Query Feedback. ICDE 2006: 39 Google ScholarDigital Library
- Stillger, M. et.al.: LEO -- DB2's LEarning Optimizer. VLDB 2001: 19--28 Google ScholarDigital Library
- Haas, P. J. et al.: Selectivity and Cost Estimation for Joins Based on Random Sampling. JCSS. 52(3): 550--569 (1996) Google ScholarDigital Library
- Kabra, N., DeWitt, D.: Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans. SIGMOD 1998 Google ScholarDigital Library
- Avnur, R., Hellerstein, J. M.: Eddies: Continuously Adaptive Query Processing SIGMOD Conference 2000: 261--272 Google ScholarDigital Library
- Zilberstein, S.: Using Anytime Algorithms in Intelligent Systems. AI Magazine 17(3): 73--83 (1996)Google Scholar
- Ioannidis, Y.E., Kang, Y.C.: Randomized Algorithms for Optimizing Large Join Queries. SIGMOD Conference 1990 Google ScholarDigital Library
- Mayrhofer, R.: Generic Heuristics for Combinatorial Optimization Problems. Proc. of the 9th International Conference on Operational Research 2002Google Scholar
- Markl, V. et.al. Consistently Estimating the Selectivity of Conjuncts of Predicates. VLDB 2005: 373--384 Google ScholarDigital Library
- Bruno, N., Chaudhuri, S., Ramamurthy, R.: Power Hints for Query Optimization. IEEE ICDE 2009 Google ScholarDigital Library
- Chaudhuri, S., Narasayya V.R., Ramamurthy R.: A Pay-As-You-Go framework for Query Execution Feedback. VLDB 2008 Google ScholarDigital Library
- Deshpande, A., Ives, Z. G., Raman, V.: Adaptive Query Processing. Foundations and Trends in Databases, 2007 Google ScholarDigital Library
- Ioannidis, Y.E.: The History of Histograms (abridged). VLDB 2003: 19--30 Google ScholarDigital Library
- Antoshenkov, G. Dynamic Query Optimization in Rdb/VMS, IEEE ICDE 1993 Google ScholarDigital Library
- Cole, R.L., Graefe, G.: Optimization of Dynamic Query Evaluation Plans. SIGMOD Conference 1994: 150--160 Google ScholarDigital Library
- Urhan, T. Franklin, M.J., Amsaleg, L.: Cost Based Query Scrambling for Initial Delays. SIGMOD Conference 1998 Google ScholarDigital Library
- Chaudhuri, S.: An Overview of Query Optimization in Relational Systems. PODS 1998: 34--43 Google ScholarDigital Library
- Ioannidis, Y.E., Christodoulakis, S.: On the Propagation of Errors in the Size of Join Results. SIGMOD 1991: 268--277 Google ScholarDigital Library
- Acharya, S. et.al. : Join Synopses for Approximate Query Answering. SIGMOD Conference 1999: 275--286 Google ScholarDigital Library
- Chaudhuri, S., Motwani, R., Narasayya, V.R.: On Random Sampling over Joins. SIGMOD Conference 1999: 263--274 Google ScholarDigital Library
- Reddy, N., Haritsa, J.: Analyzing Plan Diagrams of Database Query Optimizers. VLDB 2005: 1228--1240 Google ScholarDigital Library
- Harish D., Darera, P.N., Haritsa, J: On the Production of Anorexic Plan Diagrams. VLDB 2007: 1081--1092 Google ScholarDigital Library
- Olken F., Rotem D.: Random Sampling from Database Files: A Survey. SSDBM 1990: 92--111 Google ScholarDigital Library
- Galindo-Legaria C., et.al.: Statistics on Views. VLDB 2003 Google ScholarDigital Library
- Bruno N., Chaudhuri S.: Exploiting statistics on query expressions for optimization. SIGMOD 2002: 263--274 Google ScholarDigital Library
- Lothar F. Mackert, Guy M. Lohman: R* Optimizer Validation and Performance Evaluation for Local Queries. SIGMOD 86 Google ScholarDigital Library
- Dageville B. et.al.: Automatic SQL Tuning in Oracle 10g. VLDB 2004 Google ScholarDigital Library
- Getoor L., Taskar B., and Koller D.: (2001). Using Probabilistic Models for Selectivity Estimation. SIGMOD 2001 Google ScholarDigital Library
- Chaudhuri S., Narasayya V.R., Ramamurthy R.: Diagnosing Estimation Errors in Page Counts Using Execution Feedback. ICDE 2008. Google ScholarDigital Library
- Babcock B., Chaudhuri S.: Towards a Robust Query Optimizer: A Principled and Practical Approach. SIGMOD 2005. Google ScholarDigital Library
Index Terms
Query optimizers: time to rethink the contract?
Recommendations
Synopses for query optimization: A space-complexity perspective
Special Issue: SIGMOD/PODS 2004Database systems use precomputed synopses of data to estimate the cost of alternative plans during query optimization. A number of alternative synopsis structures have been proposed, but histograms are by far the most commonly used. While histograms ...
Optimization of joins using random record generation method
A2CWiC '10: Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in IndiaJoins are statements that retrieve data from more than one table. A Join is characterized by multiple tables in the FROM clause, and the relationship between the tables is defined through the existence of a Join condition in the WHERE clause. In the ...
Automating Statistics Management for Query Optimizers
Statistics play a key role in influencing the quality of plans chosen by a database query optimizer. In this paper, we identify the statistics that are essential for an optimizer. We introduce novel techniques that help significantly reduce the set of ...
Comments