0% found this document useful (0 votes)
152 views57 pages

CPSC471 Relational Algebra Lecture Slides

CPSC 471 Database Management Systems Winter 2015

Uploaded by

Blue
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
152 views57 pages

CPSC471 Relational Algebra Lecture Slides

CPSC 471 Database Management Systems Winter 2015

Uploaded by

Blue
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 57

CPSC471

Database Management Systems

Relational
Algebra
Dr. Robert Collier
Winter 2015

Chapter Outline

Example Database Application (COMPANY)


Relational Algebra
Unary Relational Operations
Relational Algebra Operations From Set Theory
Binary Relational Operations

Additional Relational Operations


Examples of Queries in Relational Algebra

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Database State for COMPANY

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Relational Algebra

The basic set of operations for the relational model is


known as the relational algebra. These operations enable
a user to specify basic retrieval requests.
The result of a retrieval is a new relation, which may have
been formed from one or more relations. The algebra
operations thus produce new relations, which can be
further manipulated using operations of the same algebra.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Relational Algebra

A sequence of relational algebra operations forms a


relational algebra expression, whose result will also be a
relation that represents the result of a database query (or
retrieval request).

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Unary Relational Operations

The SELECT operation is used to select a subset of the


tuples from a relation that satisfy a selection condition. It
is a filter that keeps only those tuples that satisfy a
qualifying condition those satisfying the condition are
selected while others are discarded.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Unary Relational Operations


Example: To select the EMPLOYEE tuples whose
department number is four or those whose salary is
greater than $30,000 the following notation is used:
DNO = 4 (EMPLOYEE)

SALARY > 30,000 (EMPLOYEE)


The SELECT operation is denoted by selection condition(R)
where the symbol (sigma) is used to denote the select
operator, and the selection condition is a Boolean
expression specified on the attributes of relation R

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Select Operation Properties

The SELECT operation <selection condition>(R) produces a


relation S that has the same schema as R

The SELECT operation is a commutative operation

<condition1> (<condition2> (R)) = <condition2> (<condition1> (R))

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Unary Relational Operations


A cascaded SELECT operation may be applied in any order

<condition1>( <condition2> ( <condition3> (R))


= <condition2> ( <condition3> ( <condition1> (R)))

A cascaded SELECT operation may be replaced by a single


selection with a conjunction of all the conditions
<condition1>( <condition2> ( <condition3> (R))
= <condition1> AND <condition2> AND <condition3> (R)))

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

Result of a SELECT Operation

(DNO=4 AND SALARY>25,000) OR (DNO=5 AND SALARY>30,000)(EMPLOYEE)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

10

Unary Relational Operations

The PROJECT operation selects certain columns from the


table and discards the other columns. The PROJECT
creates a vertical partitioning one with the needed
columns (attributes) containing results of the operation
and other containing the discarded Columns.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

11

Unary Relational Operations


Example: To list each employees first and last name and
salary, the following is used:
LNAME, FNAME, SALARY (EMPLOYEE)
The general form of the PROJECT operation is denoted by
<attribute list>(R) where (pi) is the symbol used to
represent the project operation and <attribute list> is the
desired list of attributes from the attributes of relation R.
The PROJECT operation removes any duplicate tuples, so
the result of the project operation is a set of tuples and
hence a valid relation.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

12

Project Operation Properties

The number of tuples in the result of projection <list> (R)


is always less or equal to the number of tuples in R.

If the list of attributes includes a key of R, then the


number of tuples is equal to the number of tuples in R.

<list1> (<list2> (R) ) = <list1> (R) as long as <list1> is a subset


of the attributes in <list2>

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

13

Result of a PROJECT Operation

LNAME, FNAME, SALARY (EMPLOYEE)

SEX, SALARY (EMPLOYEE)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

14

Unary Relational Operations

We may want to apply several relational algebra


operations one after the other. Either we can write the
operations as a single relational algebra expression by
nesting the operations, or we can apply one operation at a
time and create intermediate result relations.
In the latter case, we must give names to the relations
that hold the intermediate results, using the RENAME
operation.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

15

Unary Relational Operations

Example: To retrieve the first name, last name, and salary


of all employees who work in department number 5, we
must apply a select and a project operation. We can write
a single relational algebra expression as follows:

FNAME, LNAME, SALARY(DNO=5(EMPLOYEE))


Alternatively, we can explicitly show the sequence of
operations, giving a name to each intermediate relation:
DEP5_EMPS DNO=5(EMPLOYEE)
RESULT FNAME, LNAME, SALARY(DEP5_EMPS)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

16

Unary Relational Operations

The general RENAME operation, denoted by (rho) can be


expressed by any of the following forms, where the new
relation has been renamed from relation R:
1. S (B1BN) (R) is a renamed relation S, of columns B1Bn.
2. S (R) is a renamed relation S, without specifying columns

3. (B1Bn ) (R) is as 1, without a new name specified

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

17

Relational Algebra Operations From Set Theory

The result of the UNION operation, denoted by R S, is a


relation that includes all tuples that are either in R or in S
or in both R and S. Duplicate tuples are eliminated.
The result of the INTERSECTION operation, denoted by
R S, is a relation that includes all tuples that are in both
R and S.
The result of the SET DIFFERENCE (or MINUS) operation,
denoted by R - S, is a relation that includes all tuples that
are in R but not in S.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

18

Relational Algebra Operations From Set Theory


Example: Example: To retrieve the social security numbers
of all employees who either work in department 5 or
directly supervise an employee who works in department
5, we can use the union operation as follows:
DEP5_EMPS DNO=5 (EMPLOYEE)
RESULT1 SSN(DEP5_EMPS)
RESULT2 SUPERSSN(DEP5_EMPS)

RESULT RESULT1 RESULT2

The union operation produces the tuples that are in either


RESULT1 or RESULT2 or both.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

19

Relational Algebra Operations From Set Theory

The operands must be Type Compatible to perform the


UNION, INTERSECTION, or DIFFERENCE operations.
For operands to be considered Type Compatible, the
operand relations R1(A1, A2, ..., An) and R2(B1, B2, ..., Bn)
must have the same number of attributes, and the
domains of corresponding attributes must be compatible;
that is, dom(Ai)=dom(Bi) for i=1, 2, ..., n.

The resulting relation for R1 R2, R1 R2, or R1 - R2 has the


same attribute names as the first operand relation R1 (by
convention).

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

20

Relational Algebra Operations From Set Theory

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

21

Relational Algebra Operations From Set Theory


Both union and intersection are commutative; i.e.,
RS=SR

RS=SR

Both union and intersection can be treated as n-ary


operations applicable to any number of relations as both
are associative operations; i.e.,
R (S T) = (R S) T

(R S) T = R (S T)

The minus operation is not commutative; i.e., (in general)


R-SS-R
Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition
Copyright 2004 Pearson Education, Inc.

22

Relational Algebra Operations From Set Theory

The CARTESIAN PRODUCT operation is used to combine


tuples from two relations in a combinatorial fashion. In
general, the result of R(A1, A2, . . ., An) S(B1, B2, . . ., Bm) is a
relation Q with degree n + m attributes Q(A1, A2, . . ., An, B1,
B2, . . ., Bm), in that order.
The resulting relation Q has one tuple for each
combination of tuples one from R and one from S.
Hence, if R has nR tuples (denoted as |R| = nR), and S has nS
tuples, then R S will have nR * nS tuples.
The two operands do NOT have to be Type Compatible

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

23

Unary Relational Operations

FEMALE_EMPS SEX=F (EMPLOYEE)


EMPNAMES FNAME, LNAME, SSN (FEMALE_EMPS)
EMP_DEPENDENTS EMPNAMES DEPENDENT

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

24

Relational Algebra Operations From Set Theory

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

25

Unary Relational Operations

FEMALE_EMPS SEX=F (EMPLOYEE)


EMPNAMES FNAME, LNAME, SSN (FEMALE_EMPS)
EMP_DEPENDENTS EMPNAMES DEPENDENT
ACTUAL_DEPENDENTS SSN=ESSN (EMP_DEPENDENTS)

RESULT FNAME, LNAME, DEPENDENT_NAME (ACTUAL_DEPDENTS)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

26

Relational Algebra Operations From Set Theory

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

27

Binary Relational Operations

A sequence of CARTESIAN PRODUCTS followed by a


SELECT is used quite commonly to identify and select
related tuples from two relations. This special operation, is
called JOIN and it is denoted by .
This operation is very important for any relational
database with more than a single relation, because it
allows us to process relationships among relations.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

28

Binary Relational Operations

The general form of a JOIN operation on two relations


R(A1, A2, . . ., An) and S(B1, B2, . . ., Bm) is:
R <join condition>S
where R and S can be any relations that result from
general relational algebra expressions.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

29

Binary Relational Operations


Example: Suppose that we want to retrieve the name of
the manager of each department. To get the managers
name, we need to combine each DEPARTMENT tuple with
the EMPLOYEE tuple whose SSN value matches the
MGRSSN value in the department tuple. We do this by
using the JOIN operation.
DEPT_MGR DEPARTMENT MGRSSN=SSN EMPLOYEE
DEPT_MGR

DNAME

DNUMBER

MGRSSN

FNAME

MINIT

LNAME

SSN

Research
Administration

5
4

333445555
987654321

Franklin
Jennifer

T
S

Wong
Wallace

333445555
987654321

Headquarters

888665555

James

Borg

888665555

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

30

Binary Relational Operations

EQUIJOIN Operation
The most common use of join involves join conditions with
equality comparisons only. Such a join, where the only
comparison operator used is =, is called an EQUIJOIN. In the
result of an EQUIJOIN we always have one or more pairs of
attributes (whose names need not be identical) that have
identical values in every tuple.
The JOIN seen in the previous example was EQUIJOIN.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

31

Binary Relational Operations

NATURAL JOIN Operation


Because one of each pair of attributes with identical values is
superfluous, a new operation called natural join denoted
by * was created to get rid of the second (superfluous)
attribute in an EQUIJOIN condition.
The standard definition of natural join requires that the two
join attributes, or each pair of corresponding join attributes,
have the same name in both relations. If this is not the case,
a renaming operation is applied first.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

32

Binary Relational Operations

Example: To apply a NATURAL JOIN on the DNUMBER


attributes of DEPARTMENT and DEPT_LOCATIONS, it is
sufficient to write:
DEPT_LOCS DEPARTMENT * DEPT_LOCATIONS
DEPT_MGR

DNAME

DNUMBER

MGRSSN

MGRSTARTDATE

LOCATION

Headquarters
Administration
Research

1
4
5

888665555
987654321
333445555

1981-06-19
1995-01-01
1988-05-22

Houston
Stafford
Bellaire

Research
Research

5
5

333445555
333445555

1988-05-22
1988-05-22

Sugarland
Houston

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

33

Complete Set of Relational Operations

The set of operations including SELECT , PROJECT ,


UNION , SET DIFFERENCE , and CARTESIAN PRODUCT
is called a complete set because any other relational
algebra expression can be expressed by a combination of
these five operations. For example:
R S = (R S ) ((R S) (S R))
R <join condition> S = <join condition> (R S)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

34

Binary Relational Operations


The DIVISION operation is applied to two relations as
R(Z) S(X), where X is a subset of Z. Let Y = Z - X (and
hence Z = X Y); i.e., let Y be the set of attributes of R
that are not attributes of S.
The result of DIVISION is a relation T(Y) that includes a
tuple t if tuples tR appear in R with tR [Y] = t, and with:
tR [X] = ts

for every tuple ts in S

For a tuple t to appear in the result T of the DIVISION, the


values in t must appear in R in combination with every
tuple in S.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

35

Result of a DIVISION Operation


SSNS SSN_PNOS SMITH-PNOS

The SSN of every


person who works on
each and every project
that Smith works on
Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition
Copyright 2004 Pearson Education, Inc.

36

Result of a DIVISION Operation


TRS

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

37

Result of a DIVISION Operation


TRS

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

38

Relational Algebra Operations Summary

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

39

Relational Algebra Operations Summary

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

40

Additional Relational Operations


A type of request that cannot be expressed in the basic
relational algebra is to specify mathematical AGGREGATE
FUNCTIONS on collections of values from the database.
Examples of such functions include retrieving the average
or total salary of all employees or the total number of
employee tuples. These functions are used in simple
statistical queries that summarize information from the
database tuples.

Common functions applied to collections of numeric


values include SUM, AVERAGE, MAXIMUM, and
MINIMUM. The COUNT function is used for counting
tuples or values.
Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition
Copyright 2004 Pearson Education, Inc.

41

Additional Relational Operations

MAX Salary (Employee) and MIN Salary (Employee) retrieve


the maximum and minimum salary values from the
Employee relation, respectively.

SUM Salary

(Employee) retrieves the sum of the salary


values from the Employee relation.

DNO

COUNT SSN, AVERAGE Salary (Employee) groups employees

by DNO and computes the count of employees and


average salary per department. Please note that count just
counts the number of rows, without removing duplicates.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

42

Additional Relational Operations

Another type of operation that, in general, cannot be


specified in the basic original relational algebra is
RECURSIVE CLOSURE. This operation is applied to a
recursive relationship.

An example of a recursive operation is to retrieve all


SUPERVISEES of an EMPLOYEE e at all levelsthat is, all
EMPLOYEE e' directly supervised by e, plus all employees
e'' directly supervised by each employee e', plus all
employees e''' directly supervised by each employee e'',
etc.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

43

Additional Relational Operations

Although it is possible to retrieve employees at each level


and then take their union, we cannot, in general, specify a
query such as retrieve the supervisees of James Borg at
all levels without utilizing a looping mechanism.
The SQL3 standard includes syntax for recursive closure.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

44

Additional Relational Operations

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

45

Additional Relational Operations

In a NATURAL JOIN, tuples without a matching (or


related) tuple are eliminated from the join result. Tuples
with null in the join attributes are also eliminated. This
amounts to loss of information.
A set of operations, called OUTER JOINS, can be used
when we want to keep all the tuples in R, or all those in S,
or all those in both relations in the result of the join,
regardless of whether or not they have matching tuples in
the other relation.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

46

Additional Relational Operations

The LEFT OUTER JOIN operation keeps every tuple in the


first or left relation R in R ] S; if no matching tuple is
found in S, then the attributes of S in the join result are
filled or padded with null values.

A similar operation, RIGHT OUTER JOIN, keeps every tuple


in the second or right relation S in the result of R [ S.
A third operation, FULL OUTER JOIN, denoted by ][ ,
keeps all tuples in both the left and the right relations
when no matching tuples are found, padding them with
null values as needed.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

47

Left Outer Join

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

48

Left Outer Join

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

49

Additional Relational Operations

The OUTER UNION operation was developed to take


the union of tuples from two relations if the relations
are not union compatible.
This operation will take the union of tuples in two
relations R(X, Y) and S(X, Z) that are partially
compatible, meaning that only some of their
attributes, say X, are union compatible.

The attributes that are union compatible are


represented only once in the result, and those
attributes that are not union compatible from either
relation are also kept in the result relation T(X, Y, Z).
Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition
Copyright 2004 Pearson Education, Inc.

50

Additional Relational Operations


Example: An OUTER UNION can be applied to two
relations whose schemas are STUDENT(Name, SSN,
Department, Advisor) and INSTRUCTOR(Name, SSN,
Department, Rank). Tuples from the two relations are
matched based on having the same combination of values
of the shared attributes Name, SSN, Department. If a
student is also an instructor, both Advisor and Rank will
have a value; otherwise, one of these two attributes will
be null. The result relation STUDENT_OR_INSTRUCTOR
will have the following attributes:
STUDENT_OR_INSTRUCTOR
(Name, SSN, Department, Advisor, Rank)
Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition
Copyright 2004 Pearson Education, Inc.

51

Examples of Queries in Relational Algebra

Retrieve the name and address of all employees who work


for the Research department.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

52

Examples of Queries in Relational Algebra

Retrieve the name and address of all employees who work


for the Research department.

RESEARCH_DEPT DNAME=Research (DEPARTMENT)


RESEARCH_EMPS
(RESEARCH_DEPT DNUMBER= DNOEMPLOYEE)
RESULT FNAME, LNAME, ADDRESS (RESEARCH_EMPS)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

53

Examples of Queries in Relational Algebra


Retrieve the names of employees with no dependents.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

54

Examples of Queries in Relational Algebra


Retrieve the names of employees with no dependents.

ALL_EMPS SSN(EMPLOYEE)

EMPS_WITH_DEPS ESSN(DEPENDENT)
EMPS_WITHOUT_DEPS
(ALL_EMPS - EMPS_WITH_DEPS)
RESULT
LNAME, FNAME (EMPS_WITHOUT_DEPS * EMPLOYEE)

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

55

DIVISION Using the Operator


R

TRS

a1

b1

a1

b1

a2

b1

a2

b4

a3

b1

a3

a4

b1

a1

b2

a3

b2

a2

b3

a3

b3

a4

b3

a1

b4

a2

b4

a3

b4

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

56

DIVISION Using the , , and Operators


W B(R)

XSW

YX-R

Z B(Y)

TW-Z

b1

a1

b1

a1

b3

b2

b1

b2

a1

b2

a2

b2

b3

b4

b3

a1

b3

b4

a1

b4

a2

b1

a2

b2

a2

b3

a2

b4

a3

b1

a3

b2

a3

b3

a3

b4

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition


Copyright 2004 Pearson Education, Inc.

57

You might also like