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

What is called mirroring, What is called mirroring? The simplest approa...

What is called mirroring? The simplest approach to introducing redundancy is to duplicate each disk. This method is called mirroring or shadowing.

What is serializability, What is serializability? Explain its types? Th...

What is serializability? Explain its types? The data base system must control concurrent implementation of transactions, to ensure that the data base state remains consistent.

HYRISE, how to implement hyrise in C plus plus

how to implement hyrise in C plus plus

What is serialization and where it is used, What is serialization? Where it...

What is serialization? Where it is used and why?  Serialization is a basic term used for mechanisms which enable objects and object structures to be converted into portable for

Entity integrity constraint - relational constraints, It defines that no pr...

It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records

What is a database graph, What is a database graph? The partial orderin...

What is a database graph? The partial ordering implies that the set D may now be viewed as a directed acyclic graph, known as a database graph.

Compare wait-die deadlock prevention with wait-wound scheme, Compare wait-d...

Compare wait-die deadlock prevention scheme with wait-wound scheme   Ans:  Wait-Die Scheme  a) Based upon a nonpreemptive technique.  b) If Pi requests a resource present

Write the motivations led to development of oo-dbms, Write the motivations ...

Write the motivations led to development of OO-DBMS? 1.  Programmer frustration with RDBMSs. 2.  Requirement for special features.

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