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

Multilevel indexing scheme, Multilevel Indexing Scheme Consider the ind...

Multilevel Indexing Scheme Consider the indexing scheme where the address of the block is consider in the index for each record, for a little file, this index would be little a

Isolation or independence-transaction , Isolation or Independence : The iso...

Isolation or Independence : The isolation property shows that the updates of a transaction should not be visible till they are committed. Isolation assurance that the progresses of

Explain different types of keys and relational model., Relational Model: T...

Relational Model: The relational model uses a collection of tables to represent both data and the relationships among those data. Each table has multiple columns and each column h

Functional dependencies, CAR SALE (Car_id, Option_type, Option_listprice, S...

CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., cruise control) that were sold at a de

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

Naïve bayesian approach-id3 algorithm, You are working for the ABC Telecom ...

You are working for the ABC Telecom and are given some customer records for data mining. You are asked to discover, from the data, patterns that characterize low-, medium- and high

Dependency preservation, Dependency Preservation It is obvious that the...

Dependency Preservation It is obvious that the decomposition must be lossless so that we do not lose any information from the relation that is decomposed. Dependency preservati

Objectives-the structured query language, Objectives After reading this...

Objectives After reading this part, you should be able to: Modify, create, and delete database schema objects; Update database using SQL command; Retrieve data f

Define the one-way associations, One-way Associations When an associat...

One-way Associations When an association is traversed only in the one direction, then it is implemented as a pointer i.e.an attribute which contains an object reference. If mu

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