deletions | additions       diff --git a/section_Conclution_Optimization_is_a__.tex b/section_Conclution_Optimization_is_a__.tex  index 66f8f74..85e66d7 100644  --- a/section_Conclution_Optimization_is_a__.tex  +++ b/section_Conclution_Optimization_is_a__.tex 
...
\section{Conclution} \section{Conclusion}  Optimization is a challenging task in Databases. In Apache Derby it currently uses left-deep tree. But Bushy trees are much more computationally cost effective. Even though it is good it is hard to implement it in the Derby. To give a solution to this we have evaluated and tested our solution with an Oracle Database with the Heuristic Approach.