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

Determine the advantage of object-orientation, Determine the advantage of o...

Determine the advantage of object-orientation Finally, object-orientation has advantage of continuity throughout analysis, persistent representation and design implementation.

Entity integrity constraint - relational constraints, It defines that no pr...

It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records

Backward recovery (undo), Backward Recovery (UNDO): In this system the unco...

Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone.  Instead the system is reset to the last consistent state of databa

What is a phantom deadlock, What is a Phantom Deadlock? In distributed...

What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks

What are the physical characteristics of magnetic disks, What are the physi...

What are the physical characteristics of magnetic disks?   Ans: A magnetic disk is a circular plate or platter of plastic or metal that is coated with magnetizable material lik

Types of locks, Types of Locks There are two necessary types of locks: ...

Types of Locks There are two necessary types of locks: Binary lock : This locking mechanism has two states for to a data item: locked or unlocked Multiple-mode loc

Referential integrity constraint - relational constraints, It defines that ...

It defines that the tuple in one relation that refers to another relation must refer to an existing tuple in that relation. This constraint is states on two relations (not essentia

Develop a simple database of student records, In this programming assignmen...

In this programming assignment, you will develop a simple database of student records. Here are the requirements: 1) A student record contains a name and a number. We assume tha

Although how will the system recover, Although how will the system recover ...

Although how will the system recover The selection of REDO or UNDO for a transaction for the recovery is completed on the basis of the state of the transactions. This state is

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

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