On the production of anorexic plan diagrams

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 1081-1092

  Harish, D ^a   Darera, Pooja N ^a   Haritsa, Jayant R ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COST REDUCTION; DATABASE SYSTEMS; DIGITAL STORAGE; OPTIMIZATION;

DATABASE QUERIES; INDUSTRIAL STRENGTH; MINIMIZING THE NUMBER OF; MULTI DIMENSIONAL; OPTIMAL PERFORMANCE; PROCESSING QUALITY; QUERY OPTIMIZATION; REDUCTION ALGORITHMS;

QUERY PROCESSING;

EID: 85011101174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. G. Antonshenkov, "Dynamic Query Optimization in Rdb/VMS", Proc. of 9th IEEE Intl. Conf. on Data Engineering (ICDE), April 1993.
2. A. Betawadkar, "Query Optimization with One Parameter", Master's Thesis, Dept. of Computer Science & Engineering, IIT Kanpur, February 1999.
3. F. Chu, J. Halpern and P. Seshadri, "Least Expected Cost Query Optimization: An Exercise in Utility", Proc. of ACM Symp. on Principles of Database Systems (PODS), May 1999.
4. F. Chu, J. Halpern and J. Gehrke, "Least Expected Cost Query Optimization: What Can We Expect", Proc. of ACM Symp. on Principles of Database Systems (PODS), May 2002.
5. R. Cole and G. Graefe, "Optimization of Dynamic Query Evaluation Plans", Proc. of ACM SIGMOD Intl. Conf. on Management of Data, May 1994.
6. U. Feige, "A threshold of In n for approximating set cover", Journal of ACM, 45(4), 1998.
7. S. Ganguly, "Design and Analysis of Parametric Query Optimization Algorithms", Proc. of 24th Intl. Conf. on Very Large Data Bases (VLDB), August 1998.
8. M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", W. H. Freeman & Co, 1979.
9. Harish D., P. Darera and J. Haritsa, "Reduction of Query Optimizer Plan Diagrams", Tech. Rep. TR-2007-01, DSL/SERC, Indian Inst. of Science, 2007. http://dsl.serc.iisc.ernet.in/publications/report/TR/TR-2007-01.pdf
10. A. Hulgeri and S. Sudarshan, "Parametric Query Optimization for Linear and Piecewise Linear Cost Functions", Proc. of 28th Intl. Conf. on Very Large Data Bases (VLDB), August 2002.
11. A. Hulgeri and S. Sudarshan, "AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions", Proc. of 29th Intl. Conf. on Very Large Data Bases (VLDB), September 2003.
12. N. Kabra and D. De Witt, "Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans", Proc. of ACM SIGMOD Intl. Conf. on Management of Data, May 1998.
13. Y. Ioannidis, R. Ng, K. Shim and T. Sellis, "Parametric Query Optimization", Proc. of 18th Intl. Conf. on Very Large Data Bases (VLDB), August 1992.
14. ∗ Optimizer Validation and Performance Evaluation for Local Queries", Proc. of ACM Sigmod Intl. Conf. on Management of Data, May 1986.
15. Picasso Database Query Optimizer Visualizer, http://dsl.serc.iisc.ernet.in/projects/PICASSO/picasso.html
16. N. Reddy and J. Haritsa, "Analyzing Plan Diagrams of Database Query Optimizers", Proc. of 31st Intl. Conf. on Very Large Data Bases (VLDB), August 2005.
17. F. Reiss and T. Kanungo, "A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters", Proc. of ACM SIGMOD Intl. Conf. on Management of Data, June 2003.
18. P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie and T. Price, "Access Path Selection in a Relational Database System", Proc. of ACM SIGMOD Intl. Conf. on Management of Data, June 1979.
19. P. Slavik, "A tight analysis of the greedy algorithm for set cover", Proc. of 28th ACM Symp. on Theory of Computing, 1996.
20. M. Stillger, G. Lohman, V. Markl and M. Kandil, "LEO - DB2's LEarning Optimizer", Proc. of 27th Intl. Conf. on Very Large Data Bases (VLDB), September 2001.
21. http://www.tpc.org/tpch
22. http://www.tpc.org/tpcds