Define the query optimisation, Database Management System

Assignment Help:

Define the Query optimisation

The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonical query tree denotes a relational algebra expression that is extremely inefficient if executed directly. A query commonly has many possible execution strategies, and the process of choosing a appropriate one for processing a query is termed as query optimization. The major guidelines that are applied throughout query optimization are:

a. Combine a cascade of selections 

b. Combine a cascade of projections

c. Commute selection and projection

d. Commuting selection with join / cartesian product Commuting projection with join or cartesian product

e. Commute projection with set operations

f. Commute selection with set operations


Related Discussions:- Define the query optimisation

ERD, #question.ERD of any car

#question.ERD of any car

Which is an advantage of view, Which is an advantage of view? The Advan...

Which is an advantage of view? The Advantages of view is Data security, Derived columns and Hiding of complex queries

Ans the following, discuss the array implementation of a stack.

discuss the array implementation of a stack.

What are the several kinds of the update operations relation, What are the ...

What are the several kinds of the update operations on relations? Also explain the constraints on these update operation. Give instance in support of your answer. There are th

Task partitioning, Task Partitioning, Sequencing and Project Planning T...

Task Partitioning, Sequencing and Project Planning The tasks required for the service might be broadly partitioned into: 0.      Set up database tables and account file

Use inheritance as an implementation technique, Use inheritance as an imple...

Use inheritance as an implementation technique when you are going to use inheritance as an implementation technique, you can achieve same goal in a safer way by making one cla

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

What is 2nf, What is 2NF? A relation schema R is in 2NF if it is in 1NF...

What is 2NF? A relation schema R is in 2NF if it is in 1NF and every non-prime attribute A in R is fully functionally dependent on primary key.

Objectives of database manangement system, OBJECTIVES After going thro...

OBJECTIVES After going through this unit you should be capable to: Explain the File Based system and its limitations; Explain the structure of DBMS; Explain the

Determine the persistent object, Determine the Persistent object Persis...

Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd