Back to index

Optimization of Nonrecursive Queries

R. Krishnamurthy, H. Boral, C. Zaniolo, MCC

Summary by Armando Fox and Steve Gribble

One-line summary: In executing a rooted join tree, sub-joins should be done in rank order (to the extent that the reordering respects the partial ordering inherent in the tree). Authors show how to compute join cost based on rank for such PPT's (pipelined processing query trees, i.e n-ary join bushy trees) and LPT (linear processing trees, i.e. left or right deep trees).

Overview/Main Points



Back to index