Asked On2017-12-18 13:15:56 by:Purnima

Taged users:
Fututronbatsam22

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
Talk about this  Like  Dislike

Query processing refers to the range of activities involved in extracting data from a database. The activities include translation of queries in high-level database language, into expressions that can be used at the physical levelof the file system, a variety of query-optimization transformations, and actual evaluation of queries. The step involved in processing a query appear in figure below:

1) Parsing and translation.
2) Optimization.
3) Evaluation.
The first action, the system must take in query processing is to translate a given query into its internal form. This translation process is similar to the work performed by the parser of a compiler. In generating the internal form of the query, the parser checks the syntax of the user's query, verifies that the relation names appearing in the query are names of the relations in the database, and so on. The system constructs a parse-tree representation of the query, which it then translates into a relational-algebra expression.
Furthermore, the relational-algebra representation of a query specifies only partially how to evaluate a query. As an illustration, consider the query:
select balance from account where balance < 2500
This query can be translated into either of the following relational-algebra expressions:
• a ',Amer., 2500 (il bita„ce (account)) • n manc• (a Mance < 2500 (account))
To implement the preceding selection, we can search every tuple in account to find tuples with balance less than 2500. If a 13+-tree index is available on the attribute balance, we can use the index instead to locate the tuples. To specify fully how to evaluate a query, we need to provide not only the relational-algebra expression, but also to annotate it with instructions specifying how to evaluate each operation.
A relational-algebra operation annotated with instructions on how to evaluate it is called an evaluation primitive. A sequence balance of primitive operations that can be used to evaluate a query is a query-execution plan or query-evaluation plan. Figure illustrates an evaluation plan for our account example query, in which a particular index (denoted in the figure as "index 1") is specified for the selection operation. The query-execution engine takes a query-evaluation plan, executes that plan, and returns the answers to the query. The different evaluation plans for a give query can have different costs.

                                                               
Contributed by, Satya Shiromani

Answerd on:2018-06-07 Answerd By:satyashiromani

Likes:
|satyashiromani

Dislikes:
Be first to dislike this answer
Talk about this  Like  Dislike

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder