Query Processing in DBMS

Challenge Inside! : Find out where you stand! Try quiz, solve problems & win rewards!
Learn via video course
DBMS Course - Master the Fundamentals and Advanced Concepts
DBMS Course - Master the Fundamentals and Advanced Concepts
By Srikanth Varma
Free
5
Enrolled: 1000
DBMS Course - Master the Fundamentals and Advanced Concepts
DBMS Course - Master the Fundamentals and Advanced Concepts
Srikanth Varma
Free
5
Enrolled: 1000
Start Learning

Overview

Query processing is the way Database Management System (DBMS) parses, validates and optimizes the given query before generating a low-level code understood by the DB. Like any other High-Level Languages(HLL) where code is first compiled and then executed to perform different actions, Query Processing in DBMS also comprises of two phases, viz, compile-time and runtime.

Introduction

With SQL, operations on DBMS become a lot easier, structured, and systematic. These are not just easier for the users to understand but with the basic understanding of them, they tend to become more and more intuitive. In fact, SQL as a DBMS has evolved a lot. It even optimizes the queries for us and finds out the best way to execute it.

One of the types of DBMS is Relational Database Management System (RDBMS) where data is stored in the form of rows and columns (in other words, stored in tables) which have intuitive associations with each other. The users (both applications and humans) have the liberty to select, insert, update and delete these rows and columns without violating the constraints provided at the time of defining these relational tables. Let’s say you want the list of all the employees who have a salary of more than 10,000.

The problem here is that DBMS won't understand this statement. So for that, we have SQL (Structured Query Language) queries. SQL being a High-Level Language makes it easier not just for the users to query data based on their needs but also bridges the communication gap between the DBMS which does not really understand human language. In fact, the underlying system of DBMS won't even understand these SQL queries. For them to understand and execute a query, they first need to be converted to a Low-Level Language. The SQL queries go through a processing unit that converts them into low-level Language via Relational Algebra in DBMS. Since relational algebra queries are a bit more complex than SQL queries, DBMS expects the user to write only the SQL queries. It then processes the query before evaluating it.

Query Compilation Query Optimization code generation

As mentioned in the above image, query processing can be divided into compile-time and run-time phases. Compile-time phase includes:

  1. Parsing and Translation (Query Compilation)
  2. Query Optimization
  3. Evaluation (code generation)

In the Runtime phase, the database engine is primarily responsible for interpreting and executing the hence generated query with physical operators and delivering the query output.

A note here that as soon as any of the above stages encounters an error, they simply throw the error and return without going any further (since warnings are not fatal/terminal, that is not the case with warnings).

Parsing and Translation

The first step in query processing is Parsing and Translation. The fired queries undergo lexical, syntactic, and semantic analysis. Essentially, the query gets broken down into different tokens and white spaces are removed along with the comments (Lexical Analysis). In the next step, the query gets checked for the correctness, both syntax and semantic wise. The query processor first checks the query if the rules of SQL have been correctly followed or not (Syntactic Analysis).

Finally, the query processor checks if the meaning of the query is right or not. Things like if the table(s) mentioned in the query are present in the DB or not? if the column(s) referred from all the table(s) are actually present in them or not? (Semantic Analysis)

Once the above mentioned checks pass, the flow moves to convert all the tokens into relational expressions, graphs, and trees. This makes the processing of the query easier for the other parsers.

Let's consider the same query (mentioned below as well) as an example and see how the flow works.

Query:

The above query would be divided into the following tokens: SELECT, emp_name, FROM, employee, WHERE, salary, >, 10000.

The tokens (and hence the query) get validated for

  • The name of the queried table is looked into the data dictionary table.
  • The name of the columns mentioned (emp_name and salary) in the tokens are validated for existence.
  • The type of column(s) being compared have to be of the same type (salary and the value 10000 should have the same data type).

The next step is to translate the generated set of tokens into a relational algebra query. These are easy to handle for the optimizer in further processes.

Relational graphs and trees can also be generated but for the sake of simplicity, let's keep them out of the scope for now. Click here, to learn more about Query in DBMS.

Query Evaluation

Once the query processor has the above-mentioned relational forms with it, the next step is to apply certain rules and algorithms to generate a few other powerful and efficient data structures. These data structures help in constructing the query evaluation plans. For example, if the relational graph was constructed, there could be multiple paths from source to destination. A query execution plan will be generated for each of the paths.

possible relational graphs

As you can see in the above possible graphs, one way could be first projecting followed by selection (on the right). Another way would be to do selection followed by projection (on the left). The above sample query is kept simple and straightforward to ensure better comprehension but in the case of joins and views, more such paths (evaluation plans) start to open up. The evaluation plans may also include different annotations referring to the algorithm(s) to be used. Relational Algebra which has annotations of these sorts is known as Evaluation Primitives. You might have figured out by now that these evaluation primitives are very essential and play an important role as they define the sequence of operations to be performed for a given plan.

Query Optimization

In the next step, DMBS picks up the most efficient evaluation plan based on the cost each plan has. The aim here is to minimize the query evaluation time. The optimizer also evaluates the usage of index present in the table and the columns being used. It also finds out the best order of subqueries to be executed so as to ensure only the best of the plans gets executed.

Simply put, for any query, there are multiple evaluation plans to execute it. Choosing the one which costs the least is called Query Optimization in DBMS. Some of the factors weighed in by the optimizer to calculate the cost of a query evaluation plan is:

  • CPU time
  • Number of tuples to be scanned
  • Disk access time
  • number of operations

Conclusion

Once the query evaluation plan is selected, the system evaluates the generated low-level query and delivers the output.

Even though the query undergoes different processes before it finally gets executed, these processes take very little time in comparison to the time it actually would take to execute an un-optimized and un-validated query. Read more on indexes and see how your queries would perform in case you don't add relevant indexes. To summarise, the flow of a query processing invloves two steps:

  • Compile time
    • Parsing and Translation: break the query into tokens and check for the correctness of the query
    • Query Optimisation: Evaluate multiple query execution plans and pick the best out of them.
    • Query Generation: Generate a low level, DB executable code
  • Runtime time (execute/evaluate the hence generated query)

Read More: