deletions | additions       diff --git a/section_Discussion_With_the_proposed__.tex b/section_Discussion_With_the_proposed__.tex  index d8dd0e8..0bb5a39 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 trees  we introduce the execution plan to be evaluated as large number of let-deep trees and join them to form a one single tree. tree at the end.  This would only consider small subset of the 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 existing solution with left deep tress would perform better for queries involving less number of table joins, bushy trees would be ideal for queries involving large number of tables. In that sense considering bushy tree execution plans will be ideal in decision support systems compared to normal transactional databases databases.