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

Define access time, Define access time. Access time is the time from wh...

Define access time. Access time is the time from when a read or write request is issued to when data transfer starts.

What is specialization, What is Specialization? Specialization: Special...

What is Specialization? Specialization: Specialization permits you to describe new types of information (new structural types or latest domains of information), although reusin

Determine the three views of data, Determine the Three Views of Data We...

Determine the Three Views of Data We know that the similar thing, if viewed from dissimilar angles produces difference sights. Similarly, the database that we have formed alrea

Create a table for database transformation , Step 1 . Using Oracle, create ...

Step 1 . Using Oracle, create the tables identified in the preferred solution for Assignment 2. Technicians (ZipCode, TechnicianID, FirstName, LastName, Street, City, State, Home

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

Which file organization provides very fast access, Which file organization ...

Which file organization provides very fast access to any arbitrary record of a file? Hashed file organization provides very fast access to any arbitrary record of a file.

Explain the deadlock avoidance, Define deadlock avoidance. An alternat...

Define deadlock avoidance. An alternative method for avoiding deadlocks is to needs additional information about how resources are to be requested. Each request requires the s

Differentiate between a unique key and a primary key, Differentiate between...

Differentiate between a unique key and a primary key. - By default, clustered index on column are created by primary key while nonclustered index are created by unique key.

Dataware house(job scheduling strategy), Define a job scheduling strategy t...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pictori

What is use of generating such tables, What is use of generating such table...

What is use of generating such tables? How can you create temporary tables? When you require a table only for a short time after that you want it to disappear automatically you

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