Constructing Optimal Bushy Processing Trees forJoin

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