deletions | additions       diff --git a/section_Proposed_Solution_We_propose__.tex b/section_Proposed_Solution_We_propose__.tex  index ba706eb..5aa567b 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 left-deep  trees. For example a query involving about 10 tables will be 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.\\ queries.  Here is normal query which results in left-deep tree on oracle oracle.\\  \begin{verbatim}  SELECT STUDENT.ID as Student_ID,  
...
AND TAKES.COURSE_ID = COURSE.COURSE_ID   AND STUDENT.ID = TAKES.ID  \end{verbatim}  Now we force to build bushy tree by breaking down the queries to two sub queries. While queries, while  sub queries result in multiple left deep-tree deep-trees.\\  \begin{verbatim}  WITH  t1 as (SELECT /*+ no_merge */