论文信息 - Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard - 字舞流文

Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard

We show that constructing optimal bushy processing trees for join queries is NP-hard. More specifically, we show that even the construction of optimal bushy trees for computing the cross product for a set of relations is NP-hard.

Guido Moerkotte | Wolfgang Scheufele | G. Moerkotte | W. Scheufele

[1] Kian-Lee Tan,et al. Multi-Join Optimization for Symmetric Multiprocessors , 1993, VLDB.

[2] David Maier,et al. Rapid bushy join-order optimization with Cartesian products , 1996, SIGMOD '96.

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Yannis E. Ioannidis,et al. Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization , 1991, SIGMOD '91.

[5] Carlo Zaniolo,et al. Optimization of Nonrecursive Queries , 1986, VLDB.

[6] Clyde L. Monma,et al. Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[7] Guy M. Lohman,et al. Measuring the Complexity of Join Enumeration in Query Optimization , 1990, VLDB.

[8] Guido Moerkotte,et al. On the Complexity of Generating Optimal Left-Deep Processing Trees with Cross Products , 1995, ICDT.

[9] Patricia G. Selinger,et al. Access path selection in a relational database management system , 1979, SIGMOD '79.