csc271 database systems
DESCRIPTION
CSC271 Database Systems. Lecture # 7. Summary: Previous Lecture. Relational keys Integrity constraints Views. The Relational Algebra and Relational Calculus. Chapter 4. Introduction. Relational algebra and relational calculus are formal languages associated with the relational model - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/1.jpg)
CSC271 Database Systems
Lecture # 7
![Page 2: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/2.jpg)
Summary: Previous Lecture Relational keys Integrity constraints Views
![Page 3: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/3.jpg)
The Relational Algebra and Relational Calculus
Chapter 4
![Page 4: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/4.jpg)
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 said to be relationally complete
![Page 5: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/5.jpg)
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 is called closure property
![Page 6: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/6.jpg)
Relational Algebra Operations 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 five basic operations
Unary vs. binary operations
![Page 7: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/7.jpg)
Relational Algebra Operations..
![Page 8: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/8.jpg)
Relational Algebra Operations..
![Page 9: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/9.jpg)
Instance of Sample Database
![Page 10: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/10.jpg)
Instance of Sample Database
![Page 11: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/11.jpg)
Instance of Sample Database
![Page 12: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/12.jpg)
Selection (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)
More complex predicate can be generated using the logical operators (AND), (OR) and ~ (NOT)∧ ∨
![Page 13: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/13.jpg)
Example: Selection (Restriction) List all staff with a salary greater than £10,000
salary > 10000 (Staff)
![Page 14: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/14.jpg)
Projection a1, a2. . . , an(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
![Page 15: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/15.jpg)
Example: Projection Produce a list of salaries for all staff, showing
only staffNo, fName, lName, and salary details
ΠstaffNo, fName, lName, salary(Staff)
![Page 16: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/16.jpg)
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
![Page 17: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/17.jpg)
Example: Union List all cities where there is either a branch office
or a property for rentΠcity(Branch) Π∪ city(PropertyForRent)
![Page 18: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/18.jpg)
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
![Page 19: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/19.jpg)
Example: Set Difference List all cities where there is a branch office but
no properties for rentΠcity(Branch) - Πcity(PropertyForRent)
![Page 20: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/20.jpg)
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)
![Page 21: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/21.jpg)
Example: Intersection List all cities where there is both a branch office
and at least one property for rent Πcity(Branch) ∩ Πcity(PropertyForRent)
![Page 22: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/22.jpg)
Summary Relation algebra and operations
Selection (Restriction), projectionUnion, set difference, intersection
![Page 23: CSC271 Database Systems](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f01550346895dcdbe3b/html5/thumbnails/23.jpg)
References All the material (slides, diagrams etc.)
presented in this lecture is taken (with modifications) from the Pearson Education website :http://www.booksites.net/connbegg