this is for holding javascript data
Bhathiya edited section_Challenegs_in_Bushy_Trees__.tex
about 8 years ago
Commit id: 4c6506be69b7ab956f884fec3b135c690c40a02e
deletions | additions
diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex
index 14e20a0..79d41c9 100644
--- a/section_Challenegs_in_Bushy_Trees__.tex
+++ b/section_Challenegs_in_Bushy_Trees__.tex
...
\textit{Greedy Operator Order(GOO)}
GOO maintains a set of join trees, each of which initially consists of one base relation. The algorithm then combines the pair of join trees with the lowest cost to a single join tree.This approach is capable of building join orders fast enough. Advantage of this approach is due to the evaluation of intermediate results.
[\cite{GOO Heuristc}] [\cite{GOO}] have shown the superiority of this approach compared with others.