Visualizing the robustness of query execution

CIDR 2009 - 4th Biennal Conference on Innovative Data Systems Research

Volumn , Issue , 2009, Pages

  Graefe, Goetz ^a   Kuno, Harumi ^a   Wiener, Janet L ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILE TIME; DATABASE QUERY PROCESSING; QUERY EXECUTION; QUERY OPTIMIZATION; REAL SYSTEMS; RUNTIMES; VISUALIZATION TECHNIQUE;

DATABASE SYSTEMS; QUERY PROCESSING;

RESEARCH;

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

References (35)

1. [AB04] C. Avin and C. Brito. Efficient and robust query processing in dynamic environments using random walk techniques. IPSN, 2004.
2. [BBD05] S. Babu, P. Bizarro, and D. DeWitt. Proactive reoptimization. SIGMOD, 2005.
3. [BDT83] D. Bitton, D. J. DeWitt, and C. Turbyfill. Benchmarking database systems: a systematic approach. VLDB, 1983.
4. [BBDW05] P. Bizarro, S. Babu, D. DeWitt, and J. Widom. Content-based routing: different plans for different data. VLDB, 2005.
5. Pedro Bizarro and David J. DeWitt. Adaptive and robust query processing with SHARP. Technical Report 1562, University of Wisconsin-Madison, CS Dept., 2006.
6. [BC05] N. Bruno and S. Chaudhuri. Flexible database generators. VLDB, 2005.
7. [CG94] R. L. Cole and G. Graefe. Optimization of dynamic query evaluation plans. SIGMOD, 1994.
8. [CNR08] S. Chaudhuri, V. Narasayya, R. Ramamurthy. A Pay-As-You-Go Framework for Query Execution Feedback. VLDB, 2008.
9. [DBHH08] A. Dey, S. Bhaumik, Harish D. and J. Haritsa. Efficiently approximating query optimizer plan diagrams. VLDB, 2008.
10. [DIR07] A. Deshpande, Z. Ives, and V. Raman. Adaptive query processing. Found. Trends Databases, 1(1), 2007.
11. [EA08] K. El Gebaly and A. Aboulnaga. Robustness in automaticphysical database design. EDBT, 2008.
12. [EGKS90] S. Englert, J. Gray, T. Kocher, and P. Shah. A benchmark of Nonstop SQL release 2 demonstrating near-linear speedup and scaleup on large databases. SIGMETRICS Perform. Eval. Rev., 18(1), 1990.
13. [G87] J. Gray. A view of database system performance measures. SIGMETRICS Perf. Eval. Rev., 15(1), 1987.
14. [G92] J. Gray. Database and transaction processing benchmarks. SIGMOD, 1992.
15. [G93] G. Graefe. Query evaluation techniques for large databases. ACM Comput. Surv., 25(2), 1993.
16. [GDG02] A. Gupta, K. C. Davis, and J. Grommon-Litton. Performance comparison of property map and bitmap indexing. DOLAP, 2002.
17. Goetz Graefe, Ann Linville, Leonard D. Shapiro: Sort versus Hash Revisited. IEEE TKDE 6(6): 934-944 (1994).
18. [HDH07] D. Harish, P. N. Darera, and J. R. Haritsa. On the production of anorexic plan diagrams. VLDB, 2007.
19. [HDH08] D. Harish, P. Darera and J. Haritsa. Identifying robust plans through plan diagram reduction. VLDB, 2008.
20. [KD98] N. Kabra and D. J. DeWitt. Efficient mid-query reoptimization of sub-optimal query execution plans. SIGMOD Rec., 27(2), 1998.
21. [KKDK07] S. Krompass, H. Kuno, U. Dayal, and A. Kemper. Dynamic workload management for very large data warehouses: Juggling feathers and bowling balls. VLDB, 2007.
22. [L05] R. Lawrence. Early hash join: a configurable algorithm for the efficient and early production of join results. VLDB, 2005.
23. [LJBY95] H. Leslie, R. Jain, D. Birdsall, and H. Yaghmai. Efficient search of multi-dimensional B-trees. VLDB, 1995.
24. [ML02] V. Markl and G. Lohman. Learning table access cardinalities with LEO. SIGMOD, 2002.
25. [MRSLPC04] V. Markl, V. Raman, D. Simmen, G. Lohman, H. Pirahesh, and M. Cilimdzic. Robust query processing through progressive optimization. SIGMOD, 2004.
26. [OP06] R. Othayoth and M. Poess. The Making of TPC-DS. VLDB, 2006.
27. [PF00] M. Poess and C. Floyd. New TPC benchmarks for decision support and web commerce. SIGMOD Rec., 29(4), 2000.
28. [RH05] N. Reddy and J. R. Haritsa. Analyzing plan diagrams of database query optimizers. VLDB, 2005.
29. [SH04] P. Sarda and J. R. Haritsa. Green query optimization: taming query optimization overheads through plan recycling. VLDB, 2004.
30. [SLSL05] S. Schmidt, T. Legler, S. Schär, and W. Lehner. Robust real-time query processing with QStream. VLDB, 2005.
31. [SD89] D. A. Schneider and D. J. DeWitt. A performance evaluation of four parallel join algorithms in a sharednothing multiprocessor environment. SIGMOD Rec., 18(2), 1989.
32. [SLMK01] M. Stillger, G. M. Lohman, V. Markl, and M. Kandil. LEO - db2s learning optimizer. VLDB, 2001.
33. [VM03] M. Vieira and H. Madeira. A dependability benchmark for OLTP application environments. VLDB, 2003.
34. [ZDSZY08] M. Ziauddi, D. Das, H. Su, Y. Zhu, and K. Yagoub. Optimizer Plan Change Management: Improved Stability and Performance in Oracle 11g. VLDB 2008.
35. [ZHJLZ05] N. Zhang, P. J. Haas, V. Josifovski, G. M. Lohman, and C. Zhang. Statistical learning techniques for costing XML queries. VLDB, 2005.