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

NORRMALIZATION, Home based assignment Consider an ORDER table with the foll...

Home based assignment Consider an ORDER table with the following attributes: • Order Number (ONo),Customer Number (CNo),Customer Name (CNa),Item Number (INo),Unit Price (UP), Quant

Oracle fusion middleware, Oracle Fusion Middleware: Key Skills: Consul...

Oracle Fusion Middleware: Key Skills: Consulting,Architect, Oracle Fusion Middleware,ECM, UCM, Stellent,Identity Management, SOA Suites, BPEL, ESB,OAM,OIM,J2ee, Java, Livelink

In an e-r diagram an entity set is represent by, In an E-R diagram an entit...

In an E-R diagram an entity set is represent by? In an E-R digram entity set is represted by rectangle.

Complete replication-data replication, Complete replication: It implies ma...

Complete replication: It implies maintaining of a whole copy of the database at every site. Thus, the reliability & availability and performance for query response are maximized.

Database, real life situations where database management system are most su...

real life situations where database management system are most suitable

What is called as an n-way merge, What is called as an N-way merge? The...

What is called as an N-way merge? The merge operation is a generalization of the two-way merge used by the standard in-memory sort-merge algorithm. It merges N runs, so it is k

Explain optimistic locking and pessimistic locking, Explain the difference ...

Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it

Explain the need of parallel database, Probelm: a) In the context of OO...

Probelm: a) In the context of OODBMS, define the following terms with appropriate examples. (i) Object class. (ii) Abstract class. (iii) Aggregation. (iv)

Explain the terms primary key, Explain the terms primary key, candidate key...

Explain the terms primary key, candidate key, alternate key and secondary key. In the given table identify every key? STUDENT(SID,Regno, Name, City) Primary Key: The prim

Logical design part 1, create an e-r diagram usuing graphical dipicted soft...

create an e-r diagram usuing graphical dipicted software that could theoritically be used in resturant application

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