Scribd
Upload
32 views

SOEN 363 - Data Systems For Software Engineers: Query Optimization

This document discusses query optimization in database management systems. It begins with an overview of the layers in a DBMS and then focuses on query optimization. It describes how a query optimizer uses relational algebra equivalences to generate multiple logically equivalent query execution plans. These equivalences allow selections, projections, joins, and other operations to be reordered and combined in different ways. The document then discusses how a query optimizer estimates the cost of different plans to select the most efficient one.

Uploaded by

Elon Dusk
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views

SOEN 363 - Data Systems For Software Engineers: Query Optimization

This document discusses query optimization in database management systems. It begins with an overview of the layers in a DBMS and then focuses on query optimization. It describes how a query optimizer uses relational algebra equivalences to generate multiple logically equivalent query execution plans. These equivalences allow selections, projections, joins, and other operations to be reordered and combined in different ways. The document then discusses how a query optimizer estimates the cost of different plans to select the most efficient one.

Uploaded by

Elon Dusk
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

SOEN 363 - Data Systems

for Software Engineers


Lecture 17: Query Optimization

Essam Mansour
Today…
 Last Session:
 Query Optimization

 Today’s Session:
 Query Optimization
DBMS Layers
Queries

Query Optimization
and Execution

Relational Operators
Transaction Files and Access Methods
Manager
Recovery
Buffer Management Manager
Lock
Manager Disk Space Management

DB
Outline
A Brief Primer on Query Optimization

Evaluating Query Plans

Relational Algebra Equivalences



Estimating Plan Costs

Enumerating Plans
Relational Algebra Equivalences
 A relational query optimizer uses relational algebra
equivalences to identify many equivalent expressions for a
given query

 Two relational algebra expressions over the same set of input


relations are said to be equivalent if they produce the same
result on all relations’ instances

 Relational algebra equivalences allow us to:


 Push selections and projections ahead of joins
 Combine selections and cross-products into joins
 Choose different join orders
RA Equivalences: Selections
 Two important equivalences involve selections:
1. Cascading of Selections:
 c1 ...  cn  R   c1  . . .  cn  R
Allows us to combine several selections into one selection

OR: Allows us to replace a selection with several smaller selections

2. Commutation of Selections:
 c1  c 2  R   c 2  c1  R
Allows us to test selection conditions in either order
RA Equivalences: Projections
 One important equivalence involves projections:
 Cascading of Projections:

 a1 R   a1 ... an R 

This says that successively eliminating columns from a relation


is equivalent to simply eliminating all but the columns retained
by the final projection!
RA Equivalences: Cross-Products and Joins
 Two important equivalences involve cross-products
and joins:
1. Commutative Operations:
(R × S)  (S × R)
(R  S)  (S  R)

This allows us to choose which relation to be the inner and


which to be the outer!
RA Equivalences: Cross-Products and Joins
 Two important equivalences involve cross-products
and joins:
2. Associative Operations:
R × (S × T)  (R × S) × T
R  (S  T)  (R S)  T
It follows: R  (S  T)  (T  R)  S

This says that regardless of the order in which the relations are
considered, the final result is the same!
This order-independence is fundamental to how a query optimizer
generates alternative query evaluation plans
RA Equivalences: Selections, Projections, Cross
Products and Joins
 Selections with Projections:
 a ( c ( R ))   c ( a ( R ))

This says we can commute a selection with a projection if the


selection involves only attributes retained by the projection!

 Selections with Cross-Products:


R  cS   c ( R  S )

This says we can combine a selection with a cross-product to


form a join (as per the definition of a join)!
RA Equivalences: Selections, Projections, Cross
Products and Joins
 Selections with Cross-Products and with Joins:
 c(RS )  c(R)S
 c(R   S )  c(R)  S
Caveat: The attributes mentioned in c must appear only in R and
NOT in S

This says we can commute a selection with a cross-product or a join


if the selection condition involves only attributes of one of the
arguments to the cross-product or join!
RA Equivalences: Selections, Projections, Cross
Products and Joins
 Selections with Cross-Products and with Joins (Cont’d):
 c(RS )  (RS )
c1c2c3
 ( ( (RS )))
c1 c2 c3
 ( (R) (S ))
c1 c2 c3
This says we can push part of the selection condition c ahead of
the cross-product!
This applies to joins as well!
RA Equivalences: Selections, Projections, Cross
Products and Joins
 Projections with Cross-Products and with Joins:
 a(RS )  (R) (S )
a1 a2
 a(R   c S )  (R)  c  (S )
a1 a2
 a(R   c S )  a( (R)  c  (S ))
a1 a2
Intuitively, we need to retain only those attributes of R and S that
are either mentioned in the join condition c or included in the set
of attributes a retained by the projection
How to Estimate the Cost of Plans?
 Now that correctness is ensured, how can the DBMS
estimate the costs of various plans?

sname sname

Canonical form
rating > 5
bid=100 rating > 5

sid=sid

sid=sid
bid=100 Sailors

Reserves Sailors Reserves


Next Class
Queries

Query Optimization
Continue…
and Execution

Relational Operators
Transaction Files and Access Methods
Manager
Recovery
Buffer Management Manager
Lock
Manager Disk Space Management

DB

You might also like