deletions | additions       diff --git a/section_Query_Optimization_and_Execution__.tex b/section_Query_Optimization_and_Execution__.tex  index 988ea4f..efc4f72 100644  --- a/section_Query_Optimization_and_Execution__.tex  +++ b/section_Query_Optimization_and_Execution__.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}] \cite{GOO}  have shown the superiority of this approach compared with others.