deletions | additions       diff --git a/section_Proposed_Solution_We_propose__.tex b/section_Proposed_Solution_We_propose__.tex  index e701e1a..97447a7 100644  --- a/section_Proposed_Solution_We_propose__.tex  +++ b/section_Proposed_Solution_We_propose__.tex 
...
Here we have demonstrated our approach using of oracle database. Consider following two queries.  \begin{document}  \begin{verbatim}  SELECT STUDENT.ID as Student_ID, STUDENT.NAME as STUDENT_NAME, INSTRUCTOR.ID as Instructor_ID,COURSE.TITLE  FROM INSTRUCTOR ,TEACHES,COURSE, TAKES, STUDENT   WHERE TEACHES.COURSE_ID=COURSE.COURSE_ID AND TAKES.COURSE_ID = COURSE.COURSE_ID AND STUDENT.ID = TAKES.ID  \end{verbatim}  \begin{verbatim}  Above is normal query which results in left-deep tree on oracle  WITH  t1 as (SELECT /*+ no_merge */ INSTRUCTOR.ID as Instructor_ID, COURSE.COURSE_ID, COURSE.COURSE_ID as T1_ID   FROM INSTRUCTOR ,TEACHES,COURSE  
...
FROM t1, t2   WHERE t1.T1_ID = t2.T2_ID;  \end{verbatim}  \end{document} Here we have forced to build bushy tree by breaking down the queries to two sub queries. While sub queries result in