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 the need of a log in a dbms, What is the need of a log in a DBMS? B...

What is the need of a log in a DBMS? Briefly describe the various types of records that are normally present in a log.            Ans:  The system log, which is generally writt

Explain the cartesian product, Explain the Cartesian product:  The Cart...

Explain the Cartesian product:  The Cartesian product operation does not need relations to union-compatible.  The meaning of this is that the involved relations may have dissim

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

Case tools, explain at least five widly used case tools

explain at least five widly used case tools

What is a block and a block number, What is a block and a block number? ...

What is a block and a block number? A block is a contiguous sequence of sectors from a single track of one platter. Every request specifies the address on the disk to be refere

Referential integrity, It can be easily defined as: The database must no...

It can be easily defined as: The database must not have any unmatched foreign key values. The term "unmatched foreign key value" means a foreign key value for which there doe

Define the term multimedia database, Question : (a) Explain with the h...

Question : (a) Explain with the help of appropriate examples the difference between ‘Data' and ‘Information'. (b) A digital image is an array of pixels, where each pixel h

Explain the paths in the association network, Explain the paths in the asso...

Explain the paths in the association network We can analyze use of paths in the association network as given below: Calculate each operation Find associations whic

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