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

Concurrent transactions-backup and recovery, Representing complex relations...

Representing complex relationship among data A database may contain varieties of data interrelated to each other in numerous ways. A DBMS must have the capability to represent

Which operation is used if we are interested certain columns, Which operati...

Which operation is used if we are interested in only certain columns of a table? PROJECTION operation is used if we are interested in only certain columns of a table.

A table joined with itself is called, A table joined with itself is called ...

A table joined with itself is called ? A table joined with itself is known as self join table. Normal 0 false false false EN-IN X-NONE X-NONE

Create a database for their customers, The ABC Bank authority now wants to ...

The ABC Bank authority now wants to create a database for their customers. So you are requested to modify your program of Assignment A3 as follows. The main program first displa

Describe the primary key functions, Describe the primary key functions? ...

Describe the primary key functions? Primary Key : The primary key is an attribute or a set of attributes in which uniquely identify a specific example of an entity. Every entit

Weak entity, An example of a weak entity is Staff because the availabilityI...

An example of a weak entity is Staff because the availabilityID cannot be uniquely identified unless it is used in conjunction with the foreign key known as availabilityID in the A

E-R MODEL, WHAT IS MEANT BY E-R MODEL

WHAT IS MEANT BY E-R MODEL

Nested queries, Nested Queries Let us see some more complex queries in ...

Nested Queries Let us see some more complex queries in this section. Sub-queries: Some of the basic concerns of sub-queries are: A sub-query is a SELECT statemen

DISTIBUTED DATABASE, Define physical image of a global relation at a site

Define physical image of a global relation at a site

Explain algorithm of er to relational mapping, Explain algorithm of ER To R...

Explain algorithm of ER To Relational Mapping ? ER-to-Relational Mapping Algorithm: 1) Step 1: Mapping of regular entity types: For each strong entity type E, form a relatio

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