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

Dbms built for online transaction processing, Problem: A DBMS built for...

Problem: A DBMS built for Online Transaction Processing (OLTP) is usually regarded as unsuitable for data warehousing. Each system is designed with a different set of requireme

Concept of foreign key, Fundamentals of Database Management 1. Explai...

Fundamentals of Database Management 1. Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? 2. With a necess

Data models, why older data models are being replaced by new data models....

why older data models are being replaced by new data models.

Define radix conversion method, Define Radix conversion method  One cle...

Define Radix conversion method  One clever way to transform binary numbers to BCD notation (binary-coded decimal) is the "double dabble algorithm". It can be adapted to transfo

What is a value, What is a value? A data value is used for identity. Th...

What is a value? A data value is used for identity. This form of identity is used in relational systems.eg: The primary key value of a tuple recognize the tuple.

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

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

Draw an erd for the above relational schema, The following relational datab...

The following relational database schema represents part of a simplified database used by a library: tblBook (BookID, Title, PublisherID, Category,Price) tblPublisher (Publishe

Explain the attribute inheritance, Explain the Attribute inheritance An...

Explain the Attribute inheritance Ans: Throughout the rendering of the objects in a view, attribute sets of objects higher in the view hierarchy are inherited via objects below

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