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

Explain what is ddl, Explain what is DDL? DDL - Data Definition Languag...

Explain what is DDL? DDL - Data Definition Language: statements used to define the database structure or schema. Some examples: CREATE - to create objects in the database ALT

Define transitive dependencies, What do you understand by transitive depend...

What do you understand by transitive dependencies? Define with an example any two problems that can take place in the database if transitive dependencies are available in the datab

Update anomaly-data redundancy, Update Anomaly : This anomaly is occurred d...

Update Anomaly : This anomaly is occurred due to data redundancy. Redundant information makes updates more complex since, for example, varying the name of the instructor of MCS-014

Explain the process-oriented decomposition, Breaking into Subsystems D...

Breaking into Subsystems Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the

What is candidate key, What is Candidate Key Super Key or Candidate Ke...

What is Candidate Key Super Key or Candidate Key: It is such an attribute of a table that can uniquely recognize a row in a table. Generally they have unique values and can n

Explain data independence, Explain data independence ? Data independenc...

Explain data independence ? Data independence is the capacity to modify the schema at one stage of a database system without having to change the schema at the further level.

Explain authorization and integrity manager, Explain Authorization and Inte...

Explain Authorization and Integrity Manager ? Authorization and Integrity Manager: Tests for the satisfaction of integrity constraints and checks the authority of users to acce

Difference between left outer join and right outer join, Difference between...

Difference between LEFT OUTER JOIN and RIGHT OUTER JOIN In left outer join tuples from the left-hand-side relation which do not match any tuple in the right-hand-side relation

Case study, what problems are raised by the database? why is it so controve...

what problems are raised by the database? why is it so controversial? why is data quality an issue?

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