Lecture 5

Relational Algebra and

Relational Calculus

Pearson Education © 2009

Lecture 5 - Objectives
 Meaning of the term relational completeness.

 How to form queries in relational algebra.

 How to form queries in tuple relational calculus.

 How to form queries in domain relational calculus.

 Categories of relational DML.

2
Pearson Education © 2009
Introduction
 Relational algebra and relational calculus are formal
languages associated with the relational model.
 Informally, relational algebra is a (high-level)
procedural language and relational calculus a non-
procedural language.
 However, formally both are equivalent to one
another.
 A language that produces a relation that can be
derived using relational calculus is relationally
complete.

3
Pearson Education © 2009
Relational Algebra
 Relational algebra operations work on one or
more relations to define another relation without
changing the original relations.

 Both operands and results are relations, so

output from one operation can become input to
another operation.

 Allows expressions to be nested, just as in

arithmetic. This property is called closure.

4
Pearson Education © 2009
Relational Algebra
 Five basic operations in relational algebra:
Selection, Projection, Cartesian product, Union,
and Set Difference.

 These perform most of the data retrieval

operations needed.

 Also have Join, Intersection, and Division

operations, which can be expressed in terms of 5
basic operations.

5
Pearson Education © 2009
Relational Algebra Operations

6
Pearson Education © 2009
Relational Algebra Operations

7
Pearson Education © 2009
Selection (or Restriction)
 predicate (R)
– Works on a single relation R and defines a
relation that contains only those tuples (rows) of
R that satisfy the specified condition (predicate).

8
Pearson Education © 2009
Example - Selection (or Restriction)
 List all staff with a salary greater than £10,000.

salary > 10000 (Staff)

9
Pearson Education © 2009
Projection
 col1, . . . , coln(R)
– Works on a single relation R and defines a
relation that contains a vertical subset of R,
extracting the values of specified attributes and
eliminating duplicates.

10
Pearson Education © 2009
Example - Projection
 Produce a list of salaries for all staff, showing only
staffNo, fName, lName, and salary details.

staffNo, fName, lName, salary(Staff)

11
Pearson Education © 2009
Union
 RS
– Union of two relations R and S defines a relation
that contains all the tuples of R, or S, or both R
and S, duplicate tuples being eliminated.
– R and S must be union-compatible.

 If R and S have I and J tuples, respectively, union

is obtained by concatenating them into one relation
with a maximum of (I + J) tuples.

12
Pearson Education © 2009
Example - Union
 List all cities where there is either a branch office
or a property for rent.

city(Branch)  city(PropertyForRent)

13
Pearson Education © 2009
Set Difference
 R–S
– Defines a relation consisting of the tuples that
are in relation R, but not in S.
– R and S must be union-compatible.

14
Pearson Education © 2009
Example - Set Difference
 List all cities where there is a branch office but no
properties for rent.

city(Branch) – city(PropertyForRent)

15
Pearson Education © 2009
Intersection
 RS
– Defines a relation consisting of the set of all
tuples that are in both R and S.
– R and S must be union-compatible.

 Expressed using basic operations:

R  S = R – (R – S)

16
Pearson Education © 2009
Example - Intersection
 List all cities where there is both a branch office
and at least one property for rent.

city(Branch)  city(PropertyForRent)

17
Pearson Education © 2009
Cartesian product
 RXS
– Defines a relation that is the concatenation of
every tuple of relation R with every tuple of
relation S.

18
Pearson Education © 2009
Example - Cartesian product
 List the names and comments of all clients who have
viewed a property for rent.
(clientNo, fName, lName(Client)) X (clientNo, propertyNo, comment
(Viewing))

19
Pearson Education © 2009
Example - Cartesian product and Selection
 Use selection operation to extract those tuples where
[Link] = [Link].
[Link] = [Link]((clientNo, fName, lName(Client))  (clientNo,
propertyNo, comment(Viewing)))

 Cartesian product and Selection can be reduced to a single

operation called a Join.
20
Pearson Education © 2009
Join Operations
 Join is a derivative of Cartesian product.

 Equivalent to performing a Selection, using join

predicate as selection formula, over Cartesian
product of the two operand relations.

 One of the most difficult operations to implement

efficiently in an RDBMS and one reason why
RDBMSs have intrinsic performance problems.

21
Pearson Education © 2009
Join Operations
 Various forms of join operation
– Theta join
– Equijoin (a particular type of Theta join)
– Natural join
– Outer join
– Semijoin

22
Pearson Education © 2009
Theta join (-join)
 R FS

– Defines a relation that contains tuples

satisfying the predicate F from the Cartesian
product of R and S.
– The predicate F is of the form [Link]  [Link]
where  may be one of the comparison
operators (<, , >, , =, ).

23
Pearson Education © 2009
Theta join (-join)
 Can rewrite Theta join using basic Selection and
Cartesian product operations.

R FS = F(R  S)

 Degree of a Theta join is sum of degrees of the

operand relations R and S. If predicate F contains
only equality (=), the term Equijoin is used.

24
Pearson Education © 2009
Example - Equijoin
 List the names and comments of all clients who
have viewed a property for rent.
(clientNo, fName, lName(Client)) [Link] = [Link]
(clientNo, propertyNo, comment(Viewing))

25
Pearson Education © 2009
Natural join
 R S
– An Equijoin of the two relations R and S over all
common attributes x. One occurrence of each
common attribute is eliminated from the result.

26
Pearson Education © 2009
Example - Natural join
 List the names and comments of all clients who
have viewed a property for rent.
(clientNo, fName, lName(Client))
(clientNo, propertyNo, comment(Viewing))

27
Pearson Education © 2009
Outer join
 To display rows in the result that do not have
matching values in the join column, use Outer
join.

 R S
– (Left) outer join is join in which tuples from
R that do not have matching values in
common columns of S are also included in
result relation.

28
Pearson Education © 2009
Example - Left Outer join
 Produce a status report on property viewings.

propertyNo, street, city(PropertyForRent)

Viewing

29
Pearson Education © 2009
Semijoin
 R FS
– Defines a relation that contains the tuples of R that
participate in the join of R with S.

 Can rewrite Semijoin using Projection and Join:

R F S = A(R F S)

30
Pearson Education © 2009
Example - Semijoin
 List complete details of all staff who work at the
branch in Glasgow.

Staff [Link]=[Link] (city=‘Glasgow’(Branch))

31
Pearson Education © 2009
Division
 RS
– Defines a relation over the attributes C that consists of
set of tuples from R that match combination of every
tuple in S.

 Expressed using basic operations:

T1  C(R)
T2  C((S X T1) – R)
T  T1 – T2

32
Pearson Education © 2009
Example - Division
 Identify all clients who have viewed all properties
with three rooms.

(clientNo, propertyNo(Viewing)) 
(propertyNo(rooms = 3 (PropertyForRent)))

33
Pearson Education © 2009
Aggregate Operations
 AL(R)
– Applies aggregate function list, AL, to R to
define a relation over the aggregate list.
– AL contains one or more
(<aggregate_function>, <attribute>) pairs .
 Main aggregate functions are: COUNT, SUM,
AVG, MIN, and MAX.

34
Pearson Education © 2009
Example – Aggregate Operations
 How many properties cost more than £350 per month
to rent?

R(myCount) COUNT propertyNo (σrent > 350

(PropertyForRent))

35
Pearson Education © 2009
Grouping Operation
 AL(R)
GA
– Groups tuples of R by grouping attributes, GA,
and then applies aggregate function list, AL, to
define a new relation.
– AL contains one or more
(<aggregate_function>, <attribute>) pairs.
– Resulting relation contains the grouping
attributes, GA, along with results of each of the
aggregate functions.

36
Pearson Education © 2009
Example – Grouping Operation
 Find the number of staff working in each branch and
the sum of their salaries.

R(branchNo, myCount, mySum)

branchNo  COUNT staffNo, SUM salary (Staff)

37
Pearson Education © 2009
Relational Calculus
 Relational calculus query specifies what is to be
retrieved rather than how to retrieve it.
– No description of how to evaluate a query.

 In first-order logic (or predicate calculus), predicate is a

truth-valued function with arguments.

 When we substitute values for the arguments, function

yields an expression, called a proposition, which can be
either true or false.

38
Pearson Education © 2009
Relational Calculus
 If predicate contains a variable (e.g. ‘x is a member
of staff’), there must be a range for x.

 When we substitute some values of this range for x,

proposition may be true; for other values, it may be
false.

 When applied to databases, relational calculus has

forms: tuple and domain.

39
Pearson Education © 2009
Tuple Relational Calculus
 Interested in finding tuples for which a predicate is
true. Based on use of tuple variables.

 Tuple variable is a variable that ‘ranges over’ a named

relation: i.e., variable whose only permitted values are
tuples of the relation.

 Specify range of a tuple variable S as the Staff relation

as:
Staff(S)
 To find set of all tuples S such that P(S) is true:
{S | P(S)}
40
Pearson Education © 2009
Tuple Relational Calculus - Example
 To find details of all staff earning more than
£10,000:
{S | Staff(S)  [Link] > 10000}

 To find a particular attribute, such as salary,

write:
{[Link] | Staff(S)  [Link] > 10000}

41
Pearson Education © 2009
Tuple Relational Calculus
 Can use two quantifiers to tell how many instances
the predicate applies to:
– Existential quantifier  (‘there exists’)
– Universal quantifier  (‘for all’)

 Tuple variables qualified by  or are called

bound variables, otherwise called free variables.

42
Pearson Education © 2009
Tuple Relational Calculus
 Existential quantifier used in formulae that
must be true for at least one instance, such as:

Staff(S)  (B)(Branch(B) 
([Link] = [Link])  [Link] = ‘London’)

 Means ‘There exists a Branch tuple with same

branchNo as the branchNo of the current Staff
tuple, S, and is located in London’.

43
Pearson Education © 2009
Tuple Relational Calculus
 Universal quantifier is used in statements about
every instance, such as:
B) ([Link]  ‘Paris’)
 Means ‘For all Branch tuples, the address is not in
Paris’.

 Can also use ~(B) ([Link] = ‘Paris’) which means

‘There are no branches with an address in Paris’.

44
Pearson Education © 2009
Tuple Relational Calculus
 Formulae should be unambiguous and make sense.
 A (well-formed) formula is made out of atoms:
» R(Si), where Si is a tuple variable and R is a relation
» Si.a1 Sj.a2
» Si.a1 c
 Can recursively build up formulae from atoms:
» An atom is a formula
» If F1 and F2 are formulae, so are their conjunction, F1
 F2; disjunction, F1  F2; and negation, ~F1
» If F is a formula with free variable X, then (X)(F)
and (X)(F) are also formulae.
45
Pearson Education © 2009
Example - Tuple Relational Calculus
 List the names of all managers who earn more than
£25,000.

{[Link], [Link] | Staff(S) 

[Link] = ‘Manager’  [Link] > 25000}

 List the staff who manage properties for rent in Glasgow.

{S | Staff(S)  (P) (PropertyForRent(P)  ([Link] =

[Link])  [Link] = ‘Glasgow’)}

46
Pearson Education © 2009
Example - Tuple Relational Calculus
 List the names of staff who currently do not manage
any properties.

{[Link], [Link] | Staff(S)  (~(P)

(PropertyForRent(P)([Link] = [Link])))}
Or
{[Link], [Link] | Staff(S)  ((P)
(~PropertyForRent(P) 
~([Link] = [Link])))}

47
Pearson Education © 2009
Example - Tuple Relational Calculus
 List the names of clients who have viewed a
property for rent in Glasgow.

{[Link], [Link] | Client(C)  ((V)(P)

(Viewing(V)  PropertyForRent(P) 
([Link] = [Link]) 
([Link]=[Link]) 
[Link] =‘Glasgow’))}

48
Pearson Education © 2009
Tuple Relational Calculus
 Expressions can generate an infinite set.
For example:
{S | ~Staff(S)}

 To avoid this, add restriction that all values in

result must be values in the domain of the
expression.

49
Pearson Education © 2009
Domain Relational Calculus
 Uses variables that take values from domains
instead of tuples of relations.

 If F(d1, d2, . . . , dn) stands for a formula composed

of atoms and d1, d2, . . . , dn represent domain
variables, then:
{d1, d2, . . . , dn | F(d1, d2, . . . , dn)}
is a general domain relational calculus expression.

50
Pearson Education © 2009
Example - Domain Relational Calculus
 Find the names of all managers who earn more
than £25,000.

{fN, lN | (sN, posn, sex, DOB, sal, bN)

(Staff (sN, fN, lN, posn, sex, DOB, sal, bN) 
posn = ‘Manager’  sal > 25000)}

51
Pearson Education © 2009
Example - Domain Relational Calculus
 List the staff who manage properties for rent
in Glasgow.
{sN, fN, lN, posn, sex, DOB, sal, bN |
(sN1,cty)(Staff(sN,fN,lN,posn,sex,DOB,sal,bN) 
PropertyForRent(pN, st, cty, pc, typ, rms,
rnt, oN, sN1, bN1) 
(sN=sN1) cty=‘Glasgow’)}

52
Pearson Education © 2009
Example - Domain Relational Calculus
 List the names of staff who currently do not
manage any properties for rent.
{fN, lN | (sN)
(Staff(sN,fN,lN,posn,sex,DOB,sal,bN) 
(~(sN1) (PropertyForRent(pN, st, cty, pc, typ,
rms, rnt, oN, sN1, bN1) (sN=sN1))))}

53
Pearson Education © 2009
Example - Domain Relational Calculus
 List the names of clients who have viewed a
property for rent in Glasgow.
{fN, lN | (cN, cN1, pN, pN1, cty)
(Client(cN, fN, lN,tel, pT, mR) 
Viewing(cN1, pN1, dt, cmt) 
PropertyForRent(pN, st, cty, pc, typ,
rms, rnt,oN, sN, bN) 
(cN = cN1) (pN = pN1) cty = ‘Glasgow’)}

54
Pearson Education © 2009
Domain Relational Calculus
 When restricted to safe expressions, domain
relational calculus is equivalent to tuple
relational calculus restricted to safe expressions,
which is equivalent to relational algebra.

 Means every relational algebra expression has

an equivalent relational calculus expression, and
vice versa.

55
Pearson Education © 2009
Other Languages
 Transform-oriented languages are non-procedural
languages that use relations to transform input
data into required outputs (e.g. SQL).

 Graphical languages provide user with picture of

the structure of the relation. User fills in example
of what is wanted and system returns required
data in that format (e.g. QBE).

56
Pearson Education © 2009
Other Languages
 4GLs can create complete customized application
using limited set of commands in a user-friendly,
often menu-driven environment.

 Some systems accept a form of natural language,

sometimes called a 5GL, although this
development is still at an early stage.

57
Pearson Education © 2009