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

Assigning responsibility for operation, Assigning Responsibility for Operat...

Assigning Responsibility for Operation Many operations might have obvious target objects, but some of these operations could be used at numerous places in an algorithm, by one

By the relations get details of employees working in sql, Consider the rela...

Consider the relations: PROJECT(proj#,proj_name,chief_architect) EMPLOYEE(emp#,emp_name) ASSIGNED(proj#,emp#) Use relational algebra to express the subsequent queries: (i) Get

Describe the nested-loop join and block-nested loop join, Describe the nest...

Describe the nested-loop join and block-nested loop join.   Ans:   The block nested- loop join algorithm is as described below:     for every block B r of relation R do beg

Relationships, Let us first describe the term relationships. What Are Re...

Let us first describe the term relationships. What Are Relationships? A relationship can be defined as: A set of associations or connection, or A rule for communic

Describe the four main ways of optimising disk block access, Describe the f...

Describe the four main ways of optimising disk block access. Ans: a. Disk  b. Non-volatile writes buffers c. File organization (Clustering) d. Log-based file system

Implementation of integrity rules, Question 1 Describe the following- ...

Question 1 Describe the following- Clustering Indexing Question 2 Explain the following with suitable real time examples- Implementation of Integrity rules

Differentiate between primary and secondary storage, Differentiate between ...

Differentiate between Primary and secondary storage? Primary and secondary storage - Primary storage device stores the data temporarily. Primary storage is commonly used thro

Functional Dependencies, What exactly is the concept of Functional Dependen...

What exactly is the concept of Functional Dependencies? And how do we associate this concept with the logic of Super-keys, Candidate Keys, etc? Given Relation R(A,B,C,D,E) with de

Create a classification model, Use again the GE Flight Quest Data and build...

Use again the GE Flight Quest Data and build on the work done for homework 1 and 2. The goal is to create a classification model which classifies flights into "on-time" (you can de

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation?  Discuss the main heuristics that are applied during query optimisation.  Ans:  In heuristic optimization, heuristics are employed to r

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