deletions | additions       diff --git a/section_Discussion_With_the_proposed__.tex b/section_Discussion_With_the_proposed__.tex  index 3e7a832..d8dd0e8 100644  --- a/section_Discussion_With_the_proposed__.tex  +++ b/section_Discussion_With_the_proposed__.tex 
...
\section{Discussion}  With the proposed solution we are not going to implement the bushy tree support for Apache Derby from scratch. But benefiting from already implemented left-deep treed  we introduce the execution plan to be evaluated as large number of let-deep trees and add join  them in the final stage. to form a one single tree.  This is not would only consider small subset of  the best busy tree we can get, so possible solution space. As a improvement  we suggest further separating each left-deep tree for more sub trees recursively  to make the overall tree more bushy. Although this implementation outperform existing solution with left deep tress would perform better  forsmaller  queries involving less number of table joins it is comparatively fast in joins, bushy trees would be ideal for  queries with involving  large number of table joins. tables. In that sense considering bushy tree execution plans will be ideal in decision support systems compared to normal transactional databases