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

Concurrency control, Give the two reasons for allowing concurrency

Give the two reasons for allowing concurrency

Extended star schema model, A customer places orders for parts and belongs ...

A customer places orders for parts and belongs to a particular industry group. An individual order is taken by a particular sales representative on a specific date and the sales re

Sql, find the name of supplier who supply some red part

find the name of supplier who supply some red part

ERD, The entity type STUDENT has the following attributes: Student Name, Ad...

The entity type STUDENT has the following attributes: Student Name, Address, Phone, Age, Activity, and No of Years. Activity represents some campus-based student activity, and No o

Attribute preservation, Attribute Preservation This is a easy and obvio...

Attribute Preservation This is a easy and obvious necessity that includes preserving all the attributes that were there in the relation that is being decomposed.

One-to-many relationship, For each 1: n relationship type R involving two e...

For each 1: n relationship type R involving two entities E1 and E2, we recognize the entity type (say E1) at the n-side of the relationship type R and contain primary key of the en

Example on relational database schema, Question: The following relation...

Question: The following relational database schema corresponds to a part of a database used by the Registry Department of a university. DEPARTMENT (d#, d-name, head-of-dept)

What are the disadvantages of file-processing system, What are the disadvan...

What are the disadvantages of file-processing system?  Ans: The Disadvantages of File-Processing System a. Data redundancy and inconsistency - Data redundancy means not nece

Attributes, Attributes and its types explain?

Attributes and its types explain?

Objectives-file organisation in dbms, Objectives  After reading this un...

Objectives  After reading this unit you should be able to: Explain storage of databases on hard disks; Discuss the execution of various file Organisation techniques;

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