CPS216: Advanced Database
Systems
Notes 02:Query Processing
(Overview)
Shivnath Babu
Query Processing
Declarative SQL Query  Query Plan
NOTE: You will not be tested on how well you know
SQL. Understanding the SQL introduced in class will be
sufficient (a primer follows). SQL is described in Chapter
6, GMUW.
Focus: Relational System (i.e., data is
organized as tables, or relations)
Course Outline
• 50% of the class is about core DBMS concepts
– Query execution, query optimization, transactions,
recovery, etc.
– Textbook material
• 50% of the class is on “what is happening today in data
management”
– New developments on textbook material
– Web search – Google, Yahoo!
– Solid State Drives (Flash Drives)
– Simplifying database mgmt., self-tuning databases
– Data streams
– Data integration (structured data + unstructured data)
– Data mining
Course Logistics
• Reference: Database Systems: The Complete
Book, by H. Garcia-Molina, J. D. Ullman, and J.
Widom
• Web site: http://www.cs.duke.edu/courses/fall08/cps216
• Grading:
– Project 30%
– Homework Assignments 20%
– Midterm 20%
– Final 30%
SQL Primer
We will focus on SPJ, or Select-Project-Join Queries
Select <attribute list>
From <relation list>
Where <condition list>
Example Filter Query over R(A,B,C):
Select B
From R
Where R.A = “c”  R.C > 10
SQL Primer (contd.)
We will focus on SPJ, or Select-Project-Join-Queries
Select <attribute list>
From <relation list>
Where <condition list>
Example Join Query over R(A,B,C) and S(C,D,E):
Select B, D
From R, S
Where R.A = “c”  S.E = 2  R.C = S.C
R A
B
C
a
1
10
b
1
c
D
E
10
x
2
20
20
y
2
2
10
30
z
2
d
2
35
40
x
1
e
3
45
50
y
3
Select B,D
Answer
From R,S
Where R.A = “c”

S.E = 2  R.C=S.C
S C
B
2
D
x
• How do we execute this query?
Select B,D
From R,S
Where R.A = “c”  S.E = 2 
R.C=S.C
One idea
- Do Cartesian product
- Select tuples
- Do projection
RXS
Select B,D
R.A R.B R.C S.C S.D S.E
a
1
10
10
x
2
a
.
.
1
10
20
y
2
c
.
.
2
10
10
x
2
From R,S
Where R.A = “c”
 S.E = 2 
R.C=S.C
Bingo!
Got one...
Relational Algebra - can be used to
describe plans
Ex: Plan I
B,D
sR.A=“c” S.E=2  R.C=S.C
X
R
S
Relational Algebra Primer
(Chapter 5, GMUW)
Select: sR.A=“c” R.C=10
Project: B,D
Cartesian Product: R X S
Natural Join: R
S
Relational Algebra - can be used to
describe plans
Ex: Plan I
B,D
sR.A=“c” S.E=2  R.C=S.C
X
R
S
OR: B,D [ sR.A=“c” S.E=2  R.C = S.C (RXS)]
Another idea:
Plan II
B,D
sR.A = “c”
Select B,D
R(A,B,C)
From R,S
Where R.A = “c”

S.E = 2  R.C=S.C
sS.E = 2
S(C,D,E)
natural join
R
S
A B C
s (R)
s(S)
C D E
a 1 10
A B C
C D E
10 x 2
b 1 20
c 2 10
10 x 2
20 y 2
c 2 10
20 y 2
30 z 2
d 2 35
30 z 2
40 x 1
e 3 45
50 y 3
Select B,D
From R,S
Where R.A = “c”

S.E = 2  R.C=S.C
Plan III
Use R.A and S.C Indexes
(1) Use R.A index to select R tuples
with R.A = “c”
(2) For each R.C value found, use S.C
index to find matching tuples
(3) Eliminate S tuples S.E  2
(4) Join matching R,S tuples, project
B,D attributes, and place in result
R
A B C
a 1 10
b 1 20
A=“c”
I2
<c,2,10> <10,x,2>
check=2?
output: <2,x>
e 3 45
c 7 15
C
I1
c 2 10
d 2 35
S
C D E
10 x 2
20 y 2
30 z 2
40 x 1
50 y 3
next tuple:
<c,7,15>
Overview of
Query
Processing
SQL query
parse
parse tree
Query rewriting
statistics
Query
Optimization
logical query plan
Physical plan generation
physical query plan
execute
result
Query
Execution
Example Query
Select B,D
From R,S
Where R.A = “c”  R.C=S.C
Example: Parse Tree
<Query>
<SFW>
SELECT <SelList>
FROM
<FromList>
WHERE
<Cond>
<Attribute> <SelList> <RelName> <FromList> <Cond> AND
B
<Attribute>
R
<Cond>
<RelName>
<Attr> <Op> <Const>
D
S
R.A
Select B,D
From R,S
Where R.A = “c”  R.C=S.C
=
“c”
<Attr> <Op> <Attr>
R.C
=
S.C
Along with Parsing …
• Semantic checks
– Do the projected attributes exist in the
relations in the From clause?
– Ambiguous attributes?
– Type checking, ex: R.A > 17.5
• Expand views
SQL query
parse
parse tree
Query rewriting
statistics
Initial logical plan
Rewrite rules
Logical plan
logical query plan
Physical plan generation
physical query plan
execute
result
“Best” logical plan
Initial Logical Plan
B,D
Select B,D
From R,S
Where R.A = “c” 
R.C=S.C
sR.A = “c” Λ R.C = S.C
X
R
S
Relational Algebra: B,D [ sR.A=“c” R.C = S.C (RXS)]
Apply Rewrite Rule (1)
B,D
B,D
sR.A = “c” Λ R.C = S.C
sR.C = S.C
sR.A = “c”
X
R
S
X
R
S
B,D [ sR.C=S.C [sR.A=“c”(R X S)]]
Apply Rewrite Rule (2)
B,D
B,D
sR.C = S.C
sR.C = S.C
sR.A = “c”
X
X
R
S
sR.A = “c”
S
R
B,D [ sR.C=S.C [sR.A=“c”(R)] X S]
Apply Rewrite Rule (3)
B,D
B,D
sR.C = S.C
sR.A = “c”
X
sR.A = “c”
R
Natural join
S
B,D [[sR.A=“c”(R)]
R
S]
S
SQL query
parse
parse tree
Query rewriting
statistics
Initial logical plan
Rewrite rules
Logical plan
logical query plan
Physical plan generation
physical query plan
execute
result
“Best” logical plan