Query simplification: Graceful degradation for join-order optimization

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 403-414

  Neumann, Thomas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRACEFUL DEGRADATION; GRAPH STRUCTURES; GREEDY HEURISTICS; NP-HARD; ORDERS OF MAGNITUDE; QUERY COMPLEXITY; QUERY OPTIMIZATION; RANDOMIZED ALGORITHMS; RUNTIMES; STAR JOIN; TIME BUDGET;

COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; DATABASE SYSTEMS; GRAPHIC METHODS;

OPTIMIZATION;

EID: 70849104260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559889     Document Type: Conference Paper

References (22)

1. J. L. Bentley and A. C.-C. Yao. An almost optimal algorithm for unbounded searching. Inf. Process. Lett., 5(3):82-87, 1976.
2. D. DeHaan and F. W. Tompa. Optimal top-down join enumeration. In SIGMOD Conference, pages 785-796, 2007.
3. L. Fegaras. A new heuristic for optimizing large queries. In DEXA, pages 726-735, 1998.
4. C. A. Galindo-Legaria, A. Pellenkoft, and M. L. Kersten. Fast, randomized join-order selection - why use transformations? In VLDB, pages 85-95, 1994.
5. G. Graefe and W. J. McKenna. The volcano optimizer generator: Extensibility and eficient search. In ICDE, pages 209-218, 1993.
6. L. M. Haas, M. J. Carey, M. Livny, and A. Shukla. Seeking the truth about ad hoc join costs. VLDB J., 6(3):241-256, 1997.
7. T. Ibaraki and T. Kameda. On the optimal nesting order for computing n-relational joins. ACM Trans. Database Syst., 9(3):482-502, 1984.
8. Y. E. Ioannidis and Y. C. Kang. Randomized algorithms for optimizing large join queries. In SIGMOD Conference, pages 312-321, 1990.
9. A. Kemper, D. Kossmann, and B. Zeller. Performance tuning for SAP R/3. IEEE Data Eng. Bull., 22(2):32-39, 1999.
10. D. Kossmann and K. Stocker. Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst., 25(1):43-82, 2000.
11. R. Krishnamurthy, H. Boral, and C. Zaniolo. Optimization of nonrecursive queries. In VLDB, pages 128-137, 1986.
12. C. Lee, C.-S. Shih, and Y.-H. Chen. Optimizing large join queries using a graph-based approach. IEEE Trans. Knowl. Data Eng., 13(2):298-315, 2001.
13. G. Moerkotte and T. Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In VLDB, pages 930-941, 2006.
14. G. Moerkotte and T. Neumann. Dynamic programming strikes back. In SIGMOD Conference, pages 539-552, 2008.
15. K. Ono and G. M. Lohman. Measuring the complexity of join enumeration in query optimization. In VLDB, pages 314-325, 1990.
16. D. J. Pearce, P. H. J. Kelly, and C. Hankin. Online cycle detection and diference propagation: Applications to pointer analysis. Software Quality Journal, 12(4):311-337, 2004.
17. J. Rao, B. G. Lindsay, G. M. Lohman, H. Pirahesh, and D. E. Simmen. Using eels, a practical approach to outerjoin and antijoin reordering. In ICDE, pages 585-594, 2001.
18. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In SIGMOD Conference, pages 23-34, 1979.
19. M. Steinbrunn, G. Moerkotte, and A. Kemper. Heuristic and randomized optimization for the join ordering problem. VLDB J., 6(3):191-208, 1997.
20. A. N. Swami and A. Gupta. Optimization of large join queries. In SIGMOD Conference, pages 8-17, 1988.
21. B. Vance and D. Maier. Rapid bushy join-order optimization with cartesian products. In H. V. Jagadish and I. S. Mumick, editors, SIGMOD, pages 35-46. ACM Press, 1996.
22. F. Waas and A. Pellenkoft. Join order selection - good enough is easy. In BNCOD, pages 51-67, 2000.