deletions | additions       diff --git a/section_Conclusion_Optimization_is_a__.tex b/section_Conclusion_Optimization_is_a__.tex  index 85e66d7..80b7d43 100644  --- a/section_Conclusion_Optimization_is_a__.tex  +++ b/section_Conclusion_Optimization_is_a__.tex 
...
\section{Conclusion} \section{Conclusion and Future Work}  Optimization is a challenging task in Databases. In Apache Derby it currently uses left-deep tree. tree structures.  But Bushy trees are much more computationally cost effective. Even though it is good efficient,  it is hard to implement it in the Derby. To give a solution to this issue we suggest using restricted separate sub queries of the original query initially and join them in a later step. In order to prove our solution  we have evaluated and tested our solution with an Oracle Database with the Heuristic Approach. Approach we have chosen. Although this implementation outperform for smaller queries involving less number of table joins it is comparatively fast in queries with large number of table joins. As future work we plan to proof the concept with large data sets with higher number of table joins. And then we will implement the bushy tree solution for Derby using left-deep tree structures.\\