When we want to see this logical tree of a query, we can enable the trace flag 8605. After the query binding process, an input tree is producedĪs output. Plan will be used and all the next steps will be skipped. If any cached execution plan exists for the executed query, this query Another main responsibility of this phase is checking anyĬached plan exists for the submitted query. In this step the aggregate and group bindings regulate. At the same time, the user permissions are checked in this step. The main responsibility of this step is validating the existence of the tables and columns and other metadata objects in the database that is used in the query. The parse tree is an interior representation of the query. Otherwise, it will return a syntax error. If the query is written correctly then the query parser produces a parse tree as output and the parse tree passes into the next stage of query processing. When we submit a query in SQL Server, the first step will be to validate the query’s syntax. In this article, we will use the AdventureWorks sample database. In the following sections of the article, we will focus on these phases’ details. Parse -> Binding -> Simplification -> Trivial Plans -> Explore Search The query optimization process has formed a set of phases and each phase has different responsibilities. If you don’t have enough knowledge or you are a newbie about the execution plans, you can check out this article, How to read an execution plan with all the details.

In this context, understanding the query optimization architecture can help to resolve query performance issues more easily and we can also interpret the execution plans more logically. The reason for this problem is query optimization processes are a bit complicated and puzzling.

The query optimization is very grinding work for the database professionals who desire to overcome performance issues of the queries. This article intends to give some details about the query optimization process in SQL Server.

Quest sql tuning for oracle