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

Create a er diagram to show customer accounts, Information about a bank is ...

Information about a bank is about customers and their account. Customer has a name, address that consists of house number, area and city, and one or more phone numbers. Account ha

Describe data manipulation language, Describe Data Manipulation language ? ...

Describe Data Manipulation language ? Data Manipulation Language (DML) - A data manipulation language is a language which enables users to access or manipulate data as organize

Cataloguing, differences between a classified catalog and a dictionary cata...

differences between a classified catalog and a dictionary catalog

What function divides one numeric expression, What function divides one num...

What function divides one numeric expression by another and returns the remainder? MOD function divides one numeric expression by another and returns the remainder.

Define views in relational algebra, Views in relational algebra:   1. B...

Views in relational algebra:   1. Basic expression contains either  a) A relation in the database. b) A constant relation. 2.  General expressions are madde out of sma

Ddl compiler-database management system, DDL Compiler The DDL compile...

DDL Compiler The DDL compiler changes the data definition statements (such as CREATE TABLE .... in SQL) into a set of tables having metadata tables. These tables have infor

What is a database graph, What is a database graph? The partial orderin...

What is a database graph? The partial ordering implies that the set D may now be viewed as a directed acyclic graph, known as a database graph.

What are advantages of using an index and disadvantages, What are the advan...

What are the advantages of by using an index and what are its disadvantages ? In difference, if the search key of a secondary index is not a candidate key, it is not sufficient

Determine candidate and primary key, A video rental company has several bra...

A video rental company has several branches. The data held on each branch is the branch address made up of street, city, state, and zip code, and the telephone number. Ea

Explain the concept of deadlock, Question: In a multi-user database env...

Question: In a multi-user database environment, locking mechanisms can be used to solve the three basic problems of concurrency. On the other hand, however, locking may also le

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