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

Which is a legal expression in sql, Which is a legal expression in SQL? ...

Which is a legal expression in SQL? SELECT NAME FROM EMPLOYEE is a legal expression in SQL.

What are domain constraints, What are domain constraints?  A  domain is...

What are domain constraints?  A  domain is  a  set  of  values  that  might  be  assigned to an attribute  .all  values that appear in a  column of a relation must be taken fro

Explain domain calculus, Explain Domain calculus Domain calculus is one...

Explain Domain calculus Domain calculus is one of the types of the relational calculus. The formal specification of the domain calculus was planned after the development of the

Advantages and disadvantages of using a database system, What are the advan...

What are the advantages and disadvantages of using a database system. Sol. Advantages of Database System (DBMS) :  (1) Data Redundancy and Inconsistency: Since differen

What do you understand by data ware house, Question 1: Define the term ...

Question 1: Define the term business intelligence tools? Briefly explain how the data from one end gets transformed into information at the other end? Definition Exp

List the armstrong axioms for functional dependencies, List the Armstrong's...

List the Armstrong's axioms for functional dependencies.  What do you understand by soundness and completeness of these axioms?      Ans: The Armstrong's axioms are: F1:

Define a relation schema, A Relation Schema represented by R(A1, A2, .....

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

Index and tree structure, Index And Tree Structure Let us talk about th...

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

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