deletions | additions       diff --git a/section_Proposed_Solution_We_propose__.tex b/section_Proposed_Solution_We_propose__.tex  index 5316fc0..ba706eb 100644  --- a/section_Proposed_Solution_We_propose__.tex  +++ b/section_Proposed_Solution_We_propose__.tex 
...
\section{Proposed Solution }  We propose to implement Apache Derby bushy tree base execution plan generation as a collection of deep-left trees. For example a query involving about 10 tables will beconsidered  evaluated by joining 3 or 4 left-deep trees. Connection those tree results in a bushy tree. Main advantage of this approach is that it would benefit from already implemented left deep trees. How ever it may fail guarantee a optimum result and the level optimization would depend on the intermediate left-deep trees built. Here we have demonstrated our approach using of oracle database. Consider following two queries.\\  Here is normal query which results in left-deep tree on oracle