论文信息 - IEEE Trans. Knowl. Data Eng., 13(2):298–315, 2001.

IEEE Trans. Knowl. Data Eng., 13(2):298–315, 2001.

References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products.

[1] Martin L. Kersten,et al. Fast, Randomized Join-Order Selection - Why Use Transformations? , 1994, VLDB.

[2] Eugene J. Shekita,et al. Fundamental techniques for order optimization , 1996, SIGMOD '96.

[3] Martin L. Kersten,et al. The Complexity of Transformation-Based Join Enumeration , 1997, VLDB.

[4] Donald Kossmann,et al. Iterative dynamic programming: a new class of query optimization algorithms , 2000, TODS.

[5] Thomas Neumann,et al. Query simplification: graceful degradation for join-order optimization , 2009, SIGMOD Conference.