deletions | additions       diff --git a/Abstract.tex b/Abstract.tex  index 47bc5ae..9f750f4 100644  --- a/Abstract.tex  +++ b/Abstract.tex 
...
Query optimization is one of the most important steps in relational databases. Almost all the relational database systems such as MySQL, Postgres, Oracle DB, Apache Derbyconsist of query optimizers. Major challenge in query optimization is deciding optimum plan to execute join query. According to some researches that has been conducted related to this problem, left-deep tree and bushy trees are two main approaches to solve the problem[1]. problem[\cite{opt1}].  Apache Derby is a relational database entirely written in java. Currently Apache Derby optimizer only consider left-deep tree in its query processing. Our approach is to implement bushy tree support for derby optimizer.However research has shown that constructing bushy tree execution plans is NP hard[2]. hard[\cite{opt2}].  Therefore we are introducing heuristics that would minimize evaluations time significantly