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

Describe the strategies adopted by the ministry of ict, Question 1: (a)...

Question 1: (a) Planning and management of ICT projects have a very poor record in developing countries. Briefly explain five critical success factors for correct implementa

Marketing interface, as a customer service employee explain five measures y...

as a customer service employee explain five measures you would recommend to make even a displeased students patronize the school canteen

Clinic, Need a sample of a clinic database relationships

Need a sample of a clinic database relationships

Database application and creation, Create Relational Database Model (RDM) f...

Create Relational Database Model (RDM) for Sailing bed and breakfast club Table_Name( attribute_1, attribute_2, attribute_3, ? ,attribute_x) Primary Key ( attribute_1, attribute_2)

Explain th process to avoid re-computation, Saving Derived Attributes to Av...

Saving Derived Attributes to Avoid Re-computation Data that is derived from other data should be stored in the computed form to avoid re-computation. For this, we could define

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 and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Field, examples of fields in a database

examples of fields in a database

Discuss how the bi-directional implementations are made, Discuss how the bi...

Discuss how the bi-directional Implementations are made. In bi-directional implementation of the association, a pair of references must implement every link. The declarations a

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