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

Boyce-codd normal form (bcnf), Boyce-Codd Normal Form (BCNF) The relati...

Boyce-Codd Normal Form (BCNF) The relation NEWSTUDENT (Enrolmentno, Sno, Sname, Cname, Cno,) has every attributes participating in candidate keys as all the attributes are assu

Extended star schema, Northwind Pty Ltd sells a variety of food products th...

Northwind Pty Ltd sells a variety of food products throughout the world. They want to use the reporting features of SAP''s Business Information Warehouse to better understand thei

Write the queries in relational algebra, Problem: You are given the fol...

Problem: You are given the following schema 1. Flights(flno, from, to, distance) 2. Aircraft(aid, flno, aname, cruisingRange) 3. Certified(eid, aid) 4. Employees(eid, ena

Describe the algorithm for updating indices, Describe the algorithm for upd...

Describe the algorithm for updating indices for a single level index when a record is    (i) Inserted  (ii)  deleted What will be the modification if there are multilevel in

Explain different addressing modes of 8086, 1. Explain different addressing...

1. Explain different addressing modes of 8086 Explanation of all addressing modes 2. Write a sequence of instructions to exchange two register contents using stack

Multi-key file organisation, Multi-Key File Organisation In this part, ...

Multi-Key File Organisation In this part, we will introduce two basic file Organisation schemes that permit records to be accessed by more than one key field, therefore, allowi

Define 2nf normal form, 2NF Normal Form : A relation schema process R i...

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

Oracle, how oracle can be used

how oracle can be used

Briefly describe concurrency execution, Briefly describe concurrency execut...

Briefly describe concurrency execution? Lock - based protocols Locks There are several modes in which a data item may be locked in this section we restrict our attention

Describe log based recovery, Describe log based recovery The most usabl...

Describe log based recovery The most usably structure for recording data base modification is the LOG the log is a sequence of log records recording all the update activities i

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