## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Relational Algebra and Relational Calculus Transparencies

© Pearson Education Limited 1995, 2005

Chapter 4 - Objectives

Meaning of How How How

the term relational completeness.

to form queries in relational algebra. to form queries in tuple relational calculus.

**to form queries in domain relational calculus. relational DML.
**

2

Categories of

© Pearson Education Limited 1995, 2005

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 Limited 1995, 2005

Relational Algebra

Relational algebra operations work on

one or more relations to define another relation without changing the original relations. operands and results are relations, so output from one operation can become input to another operation. be nested, just as in arithmetic. This property is called closure.

4

Both

Allows expressions to

© Pearson Education Limited 1995, 2005

Relational Algebra

Five

basic operations in relational algebra: Selection, Projection, Cartesian product, Union, and Set Difference. of the data retrieval

These perform most

operations needed.

Also

**have Join, Intersection, and Division operations, which can be expressed in terms of 5 basic operations.
**

5

© Pearson Education Limited 1995, 2005

Relational Algebra Operations

6

© Pearson Education Limited 1995, 2005

Relational Algebra Operations

7

© Pearson Education Limited 1995, 2005

Selection (or Restriction)

Wpredicate (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 Limited 1995, 2005

**Example - Selection (or Restriction)
**

List

all staff with a salary greater than £10,000.

Wsalary > 10000 (Staff)

9

© Pearson Education Limited 1995, 2005

Projection

4col1, . . . , 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 Limited 1995, 2005

Example - Projection

Produce a

list of salaries for all staff, showing only staffNo, fName, lName, and salary details. 4staffNo, fName, lName, salary(Staff)

11

© Pearson Education Limited 1995, 2005

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 Limited 1995, 2005

Example - Union

List

all cities where there is either a branch office or a property for rent. 4city(Branch) 4city(PropertyForRent)

13

© Pearson Education Limited 1995, 2005

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 Limited 1995, 2005

**Example - Set Difference
**

List

all cities where there is a branch office but no properties for rent. 4city(Branch) ± 4city(PropertyForRent)

15

© Pearson Education Limited 1995, 2005

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. basic operations: R S = R ± (R ± S)

Expressed using

16

© Pearson Education Limited 1995, 2005

Example - Intersection

List

all cities where there is both a branch office and at least one property for rent. 4city(Branch) 4city(PropertyForRent)

17

© Pearson Education Limited 1995, 2005

Cartesian product

R

XS ± Defines a relation that is the concatenation of every tuple of relation R with every tuple of relation S.

18

© Pearson Education Limited 1995, 2005

Example - Cartesian product

List the names and comments of all clients who have viewed a property for rent.

(4clientNo, fName, lName(Client)) X (4clientNo, propertyNo, comment (Viewing))

19

© Pearson Education Limited 1995, 2005

Example - Cartesian product and Selection

Use selection operation to extract those tuples where Client.clientNo = Viewing.clientNo. WClient.clientNo = Viewing.clientNo((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 Limited 1995, 2005

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 Limited 1995, 2005

Join Operations

Various forms

of join operation

± Theta join ± Equijoin (a particular type of Theta join) ± Natural join ± Outer join ± Semijoin

22

© Pearson Education Limited 1995, 2005

**Theta join (U-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 R.ai U S.bi where U may be one of the comparison operators (<, e, >, u, =, {).

23

© Pearson Education Limited 1995, 2005

**Theta join (U-join)
**

Can

**rewrite Theta join using basic Selection and Cartesian product operations. R
**

FS

= WF(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 Limited 1995, 2005

Example - Equijoin

List

the names and comments of all clients who have viewed a property for rent. (4clientNo, fName, lName(Client)) Client.clientNo = Viewing.clientNo (4clientNo, propertyNo, comment(Viewing))

25

© Pearson Education Limited 1995, 2005

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 Limited 1995, 2005

**Example - Natural join
**

List

the names and comments of all clients who have viewed a property for rent. (4clientNo, fName, lName(Client)) (4clientNo, propertyNo, comment(Viewing))

27

© Pearson Education Limited 1995, 2005

Outer join

To

display rows in the result that do not have matching values in the join column, use Outer join. 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.

R

28

© Pearson Education Limited 1995, 2005

**Example - Left Outer join
**

Produce a

status report on property viewings.

4propertyNo, street, city(PropertyForRent) Viewing

29

© Pearson Education Limited 1995, 2005

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:
**

FS

R

= 4A(R

F

S)

30

© Pearson Education Limited 1995, 2005

Example - Semijoin

List

**complete details of all staff who work at the branch in Glasgow. Staff
**

Staff.branchNo=Branch.branchNo(Wcity=µGlasgow¶(Branch))

31

© Pearson Education Limited 1995, 2005

Division

R z 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 n 4C(R) T2 n 4C((S X T1) ± R) T n T1 ± T2

32

© Pearson Education Limited 1995, 2005

Example - Division

Identify

all clients who have viewed all properties with three rooms. (4clientNo, propertyNo(Viewing)) z (4propertyNo(Wrooms = 3 (PropertyForRent)))

33

© Pearson Education Limited 1995, 2005

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 Limited 1995, 2005

Example ± Aggregate Operations

How many properties cost more than £350 per month to rent? VR(myCount) COUNT propertyNo ( (PropertyForRent))

rent > 350

35

© Pearson Education Limited 1995, 2005

Grouping Operation

GAAL(R)

± 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 Limited 1995, 2005

Example ± Grouping Operation

**Find the number of staff working in each branch and the sum of their salaries.
**

VR(branchNo, myCount, mySum) branchNo COUNT staffNo, SUM salary (Staff)

37

© Pearson Education Limited 1995, 2005

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. first-order logic (or predicate calculus), predicate is a truth-valued function with arguments. we substitute values for the arguments, function yields an expression, called a proposition, which can be either true or false.

38

In

When

© Pearson Education Limited 1995, 2005

Relational Calculus

If

predicate contains a variable (e.g. µx is a member of staff¶), there must be a range for x. we substitute some values of this range for x, proposition may be true; for other values, it may be false. applied to databases, relational calculus has forms: tuple and domain.

When

When

39

© Pearson Education Limited 1995, 2005

**Tuple Relational Calculus
**

Interested in Tuple

finding tuples for which a predicate is true. Based on use of tuple variables. 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 Limited 1995, 2005

**Tuple Relational Calculus - Example
**

To

find details of all staff earning more than £10,000: {S | Staff(S) S.salary > 10000} find a particular attribute, such as salary, write: {S.salary | Staff(S) S.salary > 10000}

To

41

© Pearson Education Limited 1995, 2005

**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 Limited 1995, 2005

**Tuple Relational Calculus
**

Existential quantifier

**used in formulae that must be true for at least one instance, such as:
**

Staff(S) (B)(Branch(B) (B.branchNo = S.branchNo) B.city = µ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 Limited 1995, 2005

**Tuple Relational Calculus
**

Universal

quantifier is used in statements about every instance, such as: B) (B.city { µParis¶) µFor all Branch tuples, the address is not in

Means

Paris¶.

Can

also use ~(B) (B.city = µParis¶) which means µThere are no branches with an address in Paris¶.

44

© Pearson Education Limited 1995, 2005

**Tuple Relational Calculus
**

should be unambiguous and make sense. A (well-formed) formula is made out of atoms:

Formulae

**» R(Si), where Si is a tuple variable and R is a relation » Si.a1 U Sj.a2 » Si.a1 U 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 Limited 1995, 2005

Example - Tuple Relational Calculus

List the names of all managers who earn more than £25,000. {S.fName, S.lName | Staff(S) S.position = µManager¶ S.salary > 25000}

List the staff who manage properties for rent in Glasgow. {S | Staff(S) (P) (PropertyForRent(P) (P.staffNo = S.staffNo) P.city = µGlasgow¶)}

46

© Pearson Education Limited 1995, 2005

Example - Tuple Relational Calculus

List the names of staff who currently do not manage any properties. {S.fName, S.lName | Staff(S) (~(P) (PropertyForRent(P)(S.staffNo = P.staffNo)))}

Or {S.fName, S.lName | Staff(S) ((P) (~PropertyForRent(P) ~(S.staffNo = P.staffNo)))}

47

© Pearson Education Limited 1995, 2005

**Example - Tuple Relational Calculus
**

List

**the names of clients who have viewed a property for rent in Glasgow.
**

{C.fName, C.lName | Client(C) ((V)(P) (Viewing(V) PropertyForRent(P) (C.clientNo = V.clientNo) (V.propertyNo=P.propertyNo) P.city =µGlasgow¶))}

48

© Pearson Education Limited 1995, 2005

**Tuple Relational Calculus
**

Expressions

**can generate an infinite set. For example: {S | ~Staff(S)}
**

avoid this, add restriction that all values in result must be values in the domain of the expression.

To

49

© Pearson Education Limited 1995, 2005

**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 Limited 1995, 2005

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 Limited 1995, 2005

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 Limited 1995, 2005

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 Limited 1995, 2005

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 Limited 1995, 2005

**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 Limited 1995, 2005

Other Languages

Transform-oriented languages are

non-procedural languages that use relations to transform input data into required outputs (e.g. SQL). 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).

Graphical languages provide

56

© Pearson Education Limited 1995, 2005

Other Languages

4GLs can

create complete customized application using limited set of commands in a user-friendly, often menu-driven environment. systems accept a form of natural language, sometimes called a 5GL, although this development is still at an early stage.

Some

57

© Pearson Education Limited 1995, 2005

- normalization.ppt
- Relational Algebra and Relational Calculus
- 2015w Cs122a Project Quiz5
- Oracle
- Advanced MDM With Additional Examples 2016
- Exam
- RDM 2nd Chapter
- Understand Joins Simply
- tecomprc
- OLAP
- Response Db 2
- SQL
- Chap6-The Relational Algebra and Relational Calculus
- Experiment No[1]. 4 to 5 (DBMS)
- Distributed Database Management Notes - 3
- Ug Bcomcfgfggdghsffssfsfffghga Syllabus
- SQL Presentation(V1)
- Best Oracle course training institute ameerpet Hyderabad
- CSS.doc
- Date Functions in SQL Server and MySQL
- Oracle 12c Plsql Developer
- SQLQs
- 1overview
- Based on Modeling Area
- Midterm
- DBMS_UNIT3_Part2_FINAL.ppt
- Reference Manual
- 5th_sem_CSE
- PL-SQL
- 70-451_C#_ShrtNSwt

Skip carousel

- An Intelligent IR for Natural Language Query Processing using Fuzzy Logic
- UT Dallas Syllabus for cs6360.501 05f taught by Latifur Khan (lkhan)
- Survey Paper On Big Data
- UT Dallas Syllabus for cs4347.0u1.11u taught by Rekha Bhowmik (rxb080100)
- UT Dallas Syllabus for cs4347.501 05s taught by Latifur Khan (lkhan)
- UT Dallas Syllabus for se4347.501 05f taught by Greg Ozbirn (ozbirn)
- UT Dallas Syllabus for cs6360.501 05s taught by Latifur Khan (lkhan)
- Data Base Management System
- UT Dallas Syllabus for cs4347.001 05f taught by Latifur Khan (lkhan)
- Entity Relational Model and Dimentional Model
- DBMS MCQ'S
- UT Dallas Syllabus for cs6360.501.11s taught by Rekha Bhowmik (rxb080100)
- UT Dallas Syllabus for cs6360.002.08s taught by Murat Kantarcioglu (mxk055100)

- Dbms - Question Bank
- Visual Programing -TutorialforArraysandLists
- A College Student’s Guide to Computers in Education
- Hurricane Comic
- Visual Basic -The Repetition Process
- Visual Programming - Document Models
- Visual Basic Tutor
- IGNOU BCA CS-05 Solved Question Papers Dec, 2009
- IGNOU MCA MCS-21 Solved Assignments 2011
- Visual Programming - Question Bank
- Visual Programming - Searching and Sorting Arrays
- Visual Programming - Database Architecture
- Visual Programming - Microsoft Foundation
- Visual Programming - MFC-OLE-COM Concepts
- Visual Basic Concepts
- Database Management - Dbms Question Bank
- Database Management - Boyce-Codd Normalization
- Visual Basic -eBook
- User Interface Design
- concepts of Relational Algebra
- Computer Graphics -Hidden Surface Removal-elimination
- Domain - Relational Calculus
- Computer Graphics - Relational Algebra - Relational Operators -Sorting
- Computer Graphics - Question Bank
- Database Management - An Architecture for Data Warehousing Supporting
- Computer Graphics - Hardware Devices
- Computer Graphics - Hidden Surface Elimination
- Relational Algebra
- Dbms- Relational Database - Normalization

Sign up to vote on this title

UsefulNot usefulRead Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading