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

ER diagram in database, What is an ER diagram? Why is it used in Database m...

What is an ER diagram? Why is it used in Database management system (DBMS)?

What are the purpose for having variable length records, What are the purpo...

What are the purpose for having variable length records? What kinds of separator characters are required for each? Variable-Length Records - Variable-length records are thos

Software failures-database recovery and security, Software failures :  In s...

Software failures :  In such cases, a software error abruptly stops the implementation of the current transaction (or all transactions), therefore leading to losing the state of pr

What are the strategies of implementation of the statecharts, What are the ...

What are the different strategies of implementation of the Statecharts?  There are two strategies for implementation of state charts: i)   Basic Implementation Strategy

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

Database recovery and security, Database Recovery And Security Introdu...

Database Recovery And Security Introduction In this part we will introduce two main issues relating to database management systems. A computer system suffers from dissi

Using column aliases-data manipulation language, Using Column aliases E...

Using Column aliases Example: To print column names as NAME and ANNUAL SALARY SELECT ENAME "NAME", SAL*12 "ANNUAL SALARY" FROM EMP;

A distributed transaction, A Distributed Transaction Let us demonstrate...

A Distributed Transaction Let us demonstrate the concept of a distributed transaction by considering a banking system having of three branches located in 3 different cities. Ev

Describe in brief about the sequence diagrams, Describe in brief about the ...

Describe in brief about the Sequence Diagrams Sequence diagrams are interaction diagrams which emphasize time ordering of messages. In UML, it is shown as a table which shows

Linked list, what is difference between circular inked lust and grunded lin...

what is difference between circular inked lust and grunded linked list

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