database management systems 3ed, r. ramakrishnan and j. gehrke1 database management systems chapter...
TRANSCRIPT
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1
Database Management Systems
Chapter 4
Relational Algebra
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 2
Formal Relational Query Languages Two mathematical Query Languages
form the basis for “real” languages (e.g. SQL), and for implementation: Relational Algebra: More operational, very
useful for representing execution plans. Relational Calculus: Lets users describe
what they want, rather than how to compute it. (Non-operational, declarative.)
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 3
Preliminaries
A query is applied to relation instances, and the result of a query is also a relation instance. Schemas of input relations for a query are fixed
(but query will run regardless of instance!) The schema for the result of a given query is
also fixed! Determined by definition of query language constructs.
Positional vs. named-field notation: Positional notation easier for formal definitions,
named-field notation more readable. Both used in SQL
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 4
Example Schema
Sailors (sid: integer, sname: string, rating: integer, age: real);
Boats (bid: integer, bname: string, color: string);
Reserves (sid: integer, bid: integer, day: date);
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 5
Example Instances
sid sname rating age28 yuppy 9 35.031 lubber 8 55.544 guppy 5 35.058 rusty 10 35.0
sid sname rating age
22 dustin 7 45.0
31 lubber 8 55.558 rusty 10 35.0
sid bid day
22 101 10/10/9658 103 11/12/96
R1
S1
S2
We’ll use positional or named field notation, assume that names of fields in query results are `inherited’ from names of fields in query input relations.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 6
Relational Algebra Basic operations:
Selection ( ) Selects a subset of rows from relation. Projection ( ) Deletes unwanted columns from relation. Cross-product ( ) Allows us to combine two relations. Set-difference ( ) Tuples in reln. 1, but not in reln. 2. Union ( ) Tuples in reln. 1 and in reln. 2.
Additional operations: Intersection, join, division, renaming: Not essential, but (very!)
useful. Since each operation returns a relation, operations can
be composed!
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 7
Projectionsname rating
yuppy 9lubber 8guppy 5rusty 10
sname rating
S,
( )2
age
35.055.5
age S( )2
Deletes attributes that are not in projection list.
Schema of result contains exactly the fields in the projection list, with the same names that they had in the (only) input relation.
Projection operator has to eliminate duplicates! (Why??) Note: real systems typically
don’t do duplicate elimination unless the user explicitly asks for it. (Why not?)
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 8
Selection
rating
S82( )
sid sname rating age28 yuppy 9 35.058 rusty 10 35.0
sname ratingyuppy 9rusty 10
sname rating rating
S,
( ( ))82
Selects rows that satisfy selection condition.
No duplicates in result! (Why?)
Schema of result identical to schema of (only) input relation.
Result relation can be the input for another relational algebra operation! (Operator composition.)
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 9
Set Operation - Union
R U S returns a relation instance containing all tuples that occur in either relation instance R or relation instance S (or both), and the schema of the result is defined to be identical to the schema of R.
R and S are union-compatible They have the same number
of the fields, Corresponding fields, taken in
order from left to right, have the same domains.
sid sname rating age
22 dustin 7 45.031 lubber 8 55.558 rusty 10 35.044 guppy 5 35.028 yuppy 9 35.0
S S1 2
sid sname rating age
22 dustin 7 45.0
31 lubber 8 55.558 rusty 10 35.0
sid sname rating age28 yuppy 9 35.031 lubber 8 55.544 guppy 5 35.058 rusty 10 35.0
S1
S2
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 10
Set Operation - Intersection
returns a relation instance containing all tuples that occur in both R and S, and the schema of the result is defined to be identical to the schema of R.
R and S must be union-compatible.
SR
sid sname rating age
22 dustin 7 45.0
31 lubber 8 55.558 rusty 10 35.0
sid sname rating age28 yuppy 9 35.031 lubber 8 55.544 guppy 5 35.058 rusty 10 35.0
S1
S2
sid sname rating age31 lubber 8 55.558 rusty 10 35.0
21 SS
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 11
Set Operation - Set-Difference
R-S returns a relation instance containing all tuples that occur in R but not in S, and the schema of the result is defined to be identical to the schema of R.
The relations R and S must be union-compatible.
sid sname rating age
22 dustin 7 45.0
S S1 2
sid sname rating age
22 dustin 7 45.0
31 lubber 8 55.558 rusty 10 35.0
sid sname rating age28 yuppy 9 35.031 lubber 8 55.544 guppy 5 35.058 rusty 10 35.0
S1
S2
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 12
Set Operation – Cross-product
R X S returns a relation instance whose schema contains all the fields of R followed by all the fields of S, this is one tuple <r,s> for each pair of tuples r∈R, s∈S.
(sid) sname rating age (sid) bid day
22 dustin 7 45.0 22 101 10/ 10/ 96
22 dustin 7 45.0 58 103 11/ 12/ 96
31 lubber 8 55.5 22 101 10/ 10/ 96
31 lubber 8 55.5 58 103 11/ 12/ 96
58 rusty 10 35.0 22 101 10/ 10/ 96
58 rusty 10 35.0 58 103 11/ 12/ 96
sid sname rating age
22 dustin 7 45.0
31 lubber 8 55.558 rusty 10 35.0
sid bid day
22 101 10/10/9658 103 11/12/96
R1
S1
S1 X R1
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 13
Renaming
Renaming operator ρ takes an relational algebra expression E and returns an instance of a relation R.
)11 ),25 ,11(( RSsidsidR
position New name
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 14
Joins
One of most useful operations and most commonly used to combine information from two or more relations.
A join operation is defined as a cross-product, then a selection, and projection.
SR
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 15
Condition Join
Result schema same as that of cross-product. Fewer tuples than cross-product, might be able
to compute more efficiently Sometimes called a theta-join.
R c S c R S ( )
(sid) sname rating age (sid) bid day
22 dustin 7 45.0 58 103 11/ 12/ 9631 lubber 8 55.5 58 103 11/ 12/ 96
S RS sid R sid
1 11 1
. .
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 16
Equi-Join
A special case of condition join where the condition c contains only equalities.
Result schema similar to cross-product, but only one copy of fields for which equality is specified.
Natural Join: Equijoin on all common fields.
sid sname rating age bid day
22 dustin 7 45.0 101 10/ 10/ 9658 rusty 10 35.0 103 11/ 12/ 96
11.1.1RS
sidRsidS
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 17
Division Not supported as a primitive operator, but useful
for expressing queries like: Find sailors who have reserved all boats.
Let A have 2 fields, x and y; B have only 1 field y: A/B contains all x tuples such that for every y
tuple in B, there is an x y tuple in A. Or: If the set of y values associated with an x value in
A contains all y values in B, the x value is in A/B. In general, x and y can be any lists of fields; y is
the list of fields in B, and x y is the list of fields of A.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 18
Examples of Division A/B
sno pnos1 p1s1 p2s1 p3s1 p4s2 p1s2 p2s3 p2s4 p2s4 p4
pnop2
pnop2p4
pnop1p2p4
snos1s2s3s4
snos1s4
snos1
A
B1B2
B3
A/B1 A/B2 A/B3
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 19
Expressing A/B Using Basic Operators
Division is not essential op; just a useful shorthand. (Also true of joins, but joins are so common that
systems implement joins specially.) Idea: For A/B, compute all x values that are
not `disqualified’ by some y value in B. x value is disqualified if by attaching y value from
B, we obtain an xy tuple that is not in A.Disqualified x values:
A/B:
x x A B A(( ( ) ) )
x A( ) all disqualified tuples
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 20
Q1:Find names of sailors who’ve reserved boat #103
Solution 1: sname bidserves Sailors(( Re ) )103
Solution 2: ( , Re )Temp servesbid
1103
( , )Temp Temp Sailors2 1
sname Temp( )2
Solution 3: sname bidserves Sailors( (Re ))
103
C
C
C
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 21
Q2:Find names of sailors who’ve reserved a red boat
Information about boat color only available in Boats; so need an extra join: sname color red
Boats serves Sailors((' '
) Re )
A more efficient solution:
sname sid bid color redBoats s Sailors( ((
' ') Re ) )
A query optimizer can find this, given the first solution!
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 22
Q5:Find sailors who’ve reserved a red or a green boat
Can identify all red or green boats, then find sailors who’ve reserved one of these boats: ( , (
' ' ' '))Tempboats
color red color greenBoats
sname Tempboats serves Sailors( Re )
Can also define Tempboats using union! (How?)
What happens if is replaced by in this query?
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 23
Q6:Find sailors who’ve reserved a red and a green boat
Previous approach won’t work! Must identify sailors who’ve reserved red boats, sailors who’ve reserved green boats, then find the intersection (note that sid is a key for Sailors): ( , ((
' ') Re ))Tempred
sid color redBoats serves
sname Tempred Tempgreen Sailors(( ) )
( , ((' '
) Re ))Tempgreensid color green
Boats serves
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 24
Q9:Find the names of sailors who’ve reserved all boats
Uses division; schemas of the input relations to / must be carefully chosen:
( , (,
Re ) / ( ))Tempsidssid bid
servesbidBoats
sname Tempsids Sailors( )
To find sailors who’ve reserved all ‘Interlake’ boats:
/ (' '
) bid bname Interlake
Boats.....
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 25
Summary
The relational model has rigorously defined query languages that are simple and powerful.
Relational algebra is more operational; useful as internal representation for query evaluation plans.
Several ways of expressing a given query; a query optimizer should choose the most efficient version.