Dbms Chapter 3

 Database Management Systems (DBMS)
Unit-3
Relational Database Model and
Algebra
Sr. Lec. Sujan Shrestha

9801104103
sujan.shrestha@kecktm.edu.np
 Outline
Looping
• Structure of Relational Databases
• Key
• Relational Algebra
• Fundamental Operators and Syntax
 Selection
 Projection
 Cross Product OR Cartesian Product
 Joins
 Set Operators
Structure of Relational Databases
Columns (5) Table (Relation): A database object that
holds a collection of data for a speBCAfic
topic.
Student Table consist of rows and columns.
Attributes:
Title of RollNo Name Branch Semester SPI Column (Attribute): The vertical
column component of a table. A column has a name
Cardinality = No of tuples (7)

101 Ram CE 3 8
and a particular data type; e.g. varchar,
102 Laxman BCA 3 7 deBCAmal, integer, datetime etc.
Rows or 103 Bharat CE 3 6
Tuples or Record (Tuple): The horizontal component
Records (7) 104 Shatru IT 3 9 of a table, consisting of a sequence of
values, one for each column of the table. It
105 Yudh BCA 3 7 is also known as row.
106 Bhim IT 3 8
A database consists of a collection of tables
107 Arjun CE 3 9
(relations), each having a unique name.
Degree = No of columns (5)
Domain is a set of all possible unique values for a specific column.
Domain of Branch attribute is (CE, BCA, ME, EE)
Super Key
 A super key is a set of one or more attributes whose values uniquely identifies each
record within a relation (table).
Super Key Super Key

Super Key (RollNo, Branch, Sem) (SPI, Name, BL)
EnrollNo
EnrollNo RollNo Branch Sem SPI Name BL

190540107001 101 CE 3 8 Raju 0
190540107002 102 CE 3 7 Sanjay 1
190540106001 101 BCA 3 6 Mayur 2
190540106002 102 BCA 3 9 Shyam 0
180540107001 101 CE 5 7 Hitesh 1
180540106001 101 BCA 5 8 Tarun 0
180540106002 102 BCA 5 9 Suresh 0
Candidate Key
 A candidate key is a subset of a super key.
 A candidate key is a single attribute or the least combination of attributes that uniquely
identifies each record in the table.
 A candidate key is a super key for which no proper subset is a super key.
 Every candidate key is a super key but every super key is not a candidate key.
Candidate Key Candidate Key

EnrollNo (RollNo, Branch, Sem)
Super Key : (EnrollNo,RollNo)
(EnrollNo,Branch)
EnrollNo RollNo Branch Sem SPI Name BL (EnrollNo,Sem)
190540107001 101 CE 3 8 Raju 0

180540107002 101 CE 5 7 Sanjay 1
190540106001 101 BCA 3 6 Mayur 2
180540106002 101 BCA 5 9 Shyam 0
Primary Key
 A primary key is a candidate key that is chosen by database designer to identify tuples uniquely in a relation
(table).
Primary Key


190540107001 101 CE 3 8 Raju 0
180540107002 101 CE 5 7 Sanjay 1
190540106001 101 BCA 3 6 Mayur 2
180540106002 101 BCA 5 9 Shyam 0
Alternate Key
 An alternate key is a candidate key that is not chosen by database designer to identify tuples uniquely in a
relation.
Primary Key Alternate Key


190540107001 101 CE 3 8 Raju 0
180540107002 101 CE 5 7 Sanjay 1
190540106001 101 BCA 3 6 Mayur 2
180540106002 101 BCA 5 9 Shyam 0
Primary Key rules
 A primary key may have one or more attributes.
 There is only one primary key in the relation (table).
 A primary key attribute value cannot be NULL.
 Generally, the value of a primary key attribute does not change.
Foreign Key
 A foreign key is used to link two relations (tables).
 A foreign key is an attribute or collection of attributes in one table that refers to the
primary key in another table.
 A table containing the foreign key is called the child table, and the table containing the
primary key is called the parent table.
Child
Parent
Table
Table
Student Project
EnrollNo Name Branch Sem ProjectID Title EnrollNo
190540107001 Raju CE 3 101 Bank 190540107001
190540107002 Sanjay CE 3 102 College 190540107002
190540107003 Shyam CE 3 103 School 190540107003
190540107004 ram CE 3 104 Hospital 190540107001
Foreign key and referential integrity
Integrity means same all over.
If ram belong to bca then he must belong to bca faculty not to
masters in crisis or MCA
Primary Foreign key
Primary
Student key Course
key
Roll_no Name Address Course_id Course_name Roll_no
1 Simran ktm c1 DBMS 1

c2 NM 2 Referencing table
2 rajani Ktm or child table
3 sanjeev ktm
4 bibek pok Referencing table
insert
Parent or Referenced or based table 1) Insert – may cause violation
Referenced table 2) Deletion – No violation
1) Insert – no violation 3) Updation – other value can be
2) Delete – may cause violation updated but not foreign key
On delete cascade – delete in referencing table attribute
On delete Set null – keep the value null
On delete No action – first delete in referencing then only in referenced.
3) Updation - may cause violation same solution as in delete
Let R1(a,b,c) and R2(x,y,z) be two relations in which ‘a’ is foreign key in R1 that
refers to Primary key of R2. Consider four options
a) Insert into R1 b) Insert into R2 c) Delete into R1 d) Delete into R2
Which of the correct regarding referential integrity ?
1) Option a and b will cause violation
2) Option b and c will cause violation
3) Option c and d will cause violation
4) Option d and a will cause violation
R1 R2
fk
a b c x y z
Referencing table Referenced table

Let R1(a,b,c) and R2(x,y,z) be two relations in which ‘a’ is foreign key in
R1 that refers to Primary key of R2. Consider four options
a) Insert into R1 b) Insert into R2 c) Delete into R1 d) Delete into R2
Which of the correct regarding referential integrity ?
1) Option a and b will cause violation
2) Option b and c will cause violation
3) Option c and d will cause violation
4) Option d and a will cause violation
R1 R2
fk
a b c x y z
Referencing table Referenced table

Many to one relationship
2 table, where table with m relation

will have information of relation with
foreign key of another table
Degree of Relationship (Cardinality) One to One
1
Employee
1 Works
1 Department
E1
2 D1
E2 D2
3
E3 D3
4
E4 D4
5
E5 D5
6
Foreign Foreign
key Did Dname Block
Eid Ename Age key Eid Did
D1 Electronics A
E1 A 20
E1 D1 D2 Computer A Table Reduction
E2 B 21
E2 D2 D3 Lab B One to one can be merged
E3 C 20
E3 D4 D4 SBCAence and C
E4 A 22 Eid Ename Age Did
Humanities
E4 D3 E1 A 20 D1
E5 B 21
D5 Elective D
E2 B 21 D2
E3 C 20 D4
Primary key = Either Eid or Did
E4 A 22 D3
E5 B 21
One –many relationship O_no
ID Date
Item
1 M name
Name Customer Give Order
city Cost
Foreign
key Foreign
key
ID Name city ID O_no Date O_no Item Cost ID O-no Item Cost
name name
C1 A Ktm C1 O1
O1 Shoes 3000 C1 O1 Shoes 3000
C2 B Pok C1 O2
O2 Shirt 2000 C1 O2 Shirt 2000
C3 C Ktm C2 O3
O3 Jersey 1000 C2 O3 Jersey 1000
C4 D Pok C2 O4
O4 Sweater 1500 C2 O4 Sweater 1500
C5 E dang C2 O5
O5 pant 2500 C2 O5 Pant 2500
Primary key = O_no
Primary key = O_no
Can be merged to the many side
Many to many (M-N)
M N
Student Study Course
Foreign
Foreign
key
key
Roll No Name Age Roll_no C_id C_id Nmae credit

1 A 18 1 C1 C1 DBMS 6
2 B 17 2 C2 C2 OS 6
3 A 18 1 C2 C3 SL 4
4 C 18 2 C1
C4 NM 5
5 D 19 3 C3 - Not possible to
Primary
Primary key merge the table
key Primary key in referencing table - No reduction of
Composite key table
= Roll no , cid
What is the minimum number of tables required to
represent this E-R model into Relational model?
a) 2 b) 3 c) 4 d) 5
E
1 M
R1
A, B =primary key
E1 E2 c
M
N
D
R2
A A, B B
not possible to merge

Relational Algebra Operations
Operator Description
Selection Display particular rows/records/tuples from a relation
Projection Display particular columns from a relation
Cross Product Multiply each tuples of both relations
Combine data or records from two or more tables
1. Natural Join / Inner Join
Joins
2. Outer Join
1. Left Outer Join 2. Right Outer Join 3. Full Outer Join
Combine the results of two queries into a single result.
Set Operators
1. Union 2. Intersection 3. Minus / Set-difference
Selection Operator
Selection Operator
 Symbol: σ (Sigma)
 Notation: σ condition (Relation)
 Operation: Selects tuples from a relation that satisfy a given condition.
 Operators: =, <>, <, >, <=, >=, Λ (AND), V (OR)
Example Display the detail of students belongs to “CE” Branch. Answer σBranch=‘CE’ (Student)
Student Output
RollNo Name Branch SPI RollNo Name Branch SPI
101 Raju CE 8 101 Raju CE 8
102 Sanjay ME 9 104 Ram CE 9
103 Shyam BCA 9
104 Ram CE 9
Selection Operator [σ condition (Relation)]
Display the detail of students belongs to “CE” Branch and having SPI more than 8.
Example
Student
RollNo Name Branch SPI
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 9
Answer
σBranch=‘CE’ Λ SPI>8 (Student)
Output
104 ram CE 9
Display the detail of students belongs to either “BCA” or “ME” Branch.
Example
Student
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 9
Answer σBranch=‘BCA’ V Branch=‘ME’ (Student)

Output
102 Sanjay ME 9
103 Shyam BCA 9
Example Display the detail of students whose SPI between 7 and 9.
Student
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 9
Answer σSPI>7 Λ SPI<9 (Student)

Output
101 Raju CE 8
Exercise
 Write down the relational algebra for the student table. Student
 Display the detail of students whose RollNo is less than 104. RollNo Name Branch SPI
 Display the detail of students having SPI more than 8. 101 Raj CE 6
 Display the detail of students belongs to “CE” Branch having SPI less than 8. 102 ram ME 8
 Display the detail of students belongs to either “CE” or “ME” Branch. 103 Bharat EE 7
 Display the detail of students whose SPI between 6 and 9. 104 Sanjay CE 9
Employee
 Write down the relational algebra for the employee
table. EmpID Name Dept Salary
 Display the detail of all employee. 101 Shyam Sales 10000
 Display the detail of employee whose Salary more than 10000. 102 Mayur HR 25000
 Display the detail of employee belongs to “HR” Dept having 103 Swopnil HR 15000
Salary more than 20000.
 Display the detail of employee belongs to either “HR” or 104 Ajay Admin 20000
“Admin” Dept.
 Display the detail of employee whose Salary between 10000
and 25000 and belongs to “HR” Dept.
Projection Operator
Projection Operator
 Symbol: ∏ (Pi)
 Notation: ∏ attribute set (Relation)

 Operation: Selects specified attributes of a relation.
 It removes duplicate tuples (records) from the result.
Example Display RollNo, Name and Branch of all students. Answer ∏ RollNo, Name, Branch (Student)
Student Output
RollNo Name Branch SPI RollNo Name Branch
101 Raju CE 8 101 Raju CE
102 Sanjay ME 9 102 Sanjay ME
103 Shyam BCA 9 103 Shyam BCA
104 ram CE 9 104 ram CE
Exercise
 Display RollNo, Name and SPI of all students. RollNo Name Branch SPI
 Display Name and SPI of all students. 101 Raj CE 6
 Display the Name of all students. 102 ram ME 8
 Display the Name of all branches. 103 Bharat EE 7
104 Sanjay CE 9
Employee
 Write down the relational algebra for the employee
 Display EmpID with Name of all employee. 101 Shyam Sales 10000
 Display Name and Salary of all employee. 102 Mayur HR 25000
 Display the Name of all employee. 103 Swopnil HR 15000
 Display the Name of all departments.
104 Ajay Admin 20000
Combined Projection & Selection Operation
Example Display RollNo, Name & Branch of “ME” Branch students.
Student
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 7
Step-1 σBranch=‘ME’ (Student) Answer ∏ RollNo, Name, Branch (σBranch=‘ME’ (Student))
Output-1 Output-2
RollNo Name Branch SPI RollNo Name Branch
102 Sanjay ME 9 102 Sanjay ME
Example Display Name, Branch and SPI of students whose SPI is more than 8.
Student
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 7
Step-1 σSPI>8 (Student)

Answer
∏ Name, Branch, SPI (σSPI>8 (Student))
Output-1 Output-2
RollNo Name Branch SPI Name Branch SPI
102 Sanjay ME 9 Sanjay ME 9
103 Shyam BCA 9 Shyam BCA 9
Example Display Name, Branch and SPI of students who belongs to “CE” Branch and SPI is more than 7.
Student
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 7
Step-1
σBranch=‘CE’ Λ SPI>7 (Student)
Answer
∏ Name, Branch, SPI (σBranch=‘CE’ Λ SPI>7 (Student))
Output-1 Output-2
RollNo Name Branch SPI Name Branch SPI
101 Raju CE 8 Raju CE 8
Example Display Name of students along with their Branch who belong to either “ME” Branch or “BCA” Branch.
Student
101 Raju CE 8
102 Sanjay ME 9
103 Shyam BCA 9
104 ram CE 7
Step-1
σBranch=‘ME’ V Branch=‘BCA’ (Student)
Answer ∏ Name, Branch (σBranch=‘ME’ V Branch=‘BCA’ (Student))
Output-1 Output-2
RollNo Name Branch SPI Name Branch
102 Sanjay ME 9 Sanjay ME
103 Shyam BCA 9 Shyam BCA
Exercise ∏ RollNo, Name, SPI (σ Branch=‘CE’ (Student))
 Display Rollno, Name and SPI of all students belongs to “CE” Branch. RollNo Name Branch SPI
 List the Name of students with their Branch whose SPI is more than 8 and 101 Raj CE 6
belongs to “CE” Branch.
 List the Name of students along with their Branch and SPI who belongs to
102 ram ME 8
either “CE” or “ME” Branch and having SPI more than 8. 103 Bharat EE 7
 Display the Name of students with their Branch name whose SPI between 7
and 9. 104 Sanjay CE 9
 Write down the relational algebra for the employee Employee

 Display the Name of employee belong to “HR” Dept and 101 Shyam Sales 10000
having salary more than 20000.
102 Mayur HR 25000
 Display the Name of all “Admin” and “HR” Dept’s employee.
 List the Name of employee with their Salary who belongs to 103 Swopnil HR 15000
“HR” or “Admin” Dept having salary more than 15000. 104 Ajay Admin 20000
 Display the Name of employee along with their Dept name
whose salary between 15000 and 30000.
Cartesian Product / Cross Product
Cartesian Product / Cross Product
 Symbol: X (Cross)
 Notation: Relation-1 (R1) X Relation-2 (R2) OR Algebra-1 X Algebra-2
 Operation: It will multiply each tuples of Relation-1 to each tuples of Relation-2.
 Attributes of Resultant Relation = Attributes of R1 + Attributes of R2
 Tuples of Resultant Relation = Tuples of R1 * Tuples of R2
Example Perform Cross Product between Student and Result. Answer (Student) X (Result)
Student Result Output

RNo Name Branch RNo SPI Student.RNo Name Branch Result.RNo SPI
101 Raju CE 101 8 101 Raju CE 101 8
102 Sanjay ME 102 9 101 Raju CE 102 9
102 Sanjay ME 101 8
If both relations have some attribute with the
same name, it can be distinguished by combing 102 Sanjay ME 102 9
relation-name.attribute-name.
Cartesian Product / Cross Product Example
Consider only selected attributes
• Student – RNo, Name and Branch
Example Perform Cross Product between Student and Result. • Result – RNo, SPI (Student Perception of
instruction)and Blended Learning(BL).
Student Result
RNo Name Branch Sem RNo SPI BL Rank
101 Raju CE 3 101 8 1 2
102 Sanjay ME 5 103 9 0 1
Answer ∏ RNo, Name, Branch (Student) X ∏ RNo, SPI, BL (Result)

Output
Student.RNo Name Branch Result.RNo SPI BL
101 Raju CE 101 8 1
101 Raju CE 103 9 0
102 Sanjay ME 101 8 1
102 Sanjay ME 103 9 0
Cartesian Product / Cross Product Example
Consider only selected tuples
Example Perform Cross Product between Student and Result.
• Student – Branch=‘CE’ and
Sem=3
Student Result
• Result – SPI>7 and BL<1
RNo Name Branch Sem RNo SPI BL Rank • Display only
101 Raju CE 3 101 8 1 2 rollno,name,branch of
student and rollno,spi,bl of
102 Sanjay ME 5 103 9 0 1 result.
103 Om CE 3 105 7 2 3
104 krishna CE 5
(∏ Rno,name,branch σBranch=‘CE’ Λ Sem=3 (Student) )X ∏ Rno,spi,bl (σSPI>7 Λ BL<1) (Result)
Answer
Output
Student.RNo Name Branch Sem Result.RNo SPI BL Rank
101 Raju CE 3 103 9 0 1
103 OM CE 3 103 9 0 1
Natural Join / Inner Join
Natural Join / Inner Join
 Symbol:
 Notation: Relation-1 (R1) Relation-2 (R2) OR Algebra-1 Algebra-2
 Operation: Natural join will retrieve consistent data from multiple relations.
 It combines records from different relations that satisfy a given condition.
Steps performed in Natural Join

Steps Description
Step – 1 It performs Cartesian Product
Step – 2 Then it deletes inconsistent tuples
Then it removes an attribute from duplicate
Step – 3
attributes
Natural Join / Inner Join Example
Example Perform Natural Join between Student and Result. Answer (Student) (Result)

RNo Name Branch RNo SPI RNo Name Branch SPI
101 Raju CE 101 8 101 Raju CE 8
102 Sanjay ME 103 9 To perform a Natural Join there must be one
common attribute (column) between two
Steps performed in Natural Join relations.
Step:1 Perform Cross Product Step:2 Removes inconsistent tuples

Student.RNo Name Branch Result.RNo SPI Student.RNo Name Branch Result.RNo SPI
101 Raju CE 101 8 101 Raju CE 101 8
101 Raju CE 103 9 Step:3 Removes an attribute from duplicate
102 Sanjay ME 101 8 RNo Name Branch SPI
102 Sanjay ME 103 9 101 Raju CE 8
Natural Join / Inner Join Example
Example Perform Natural Join between Branch and Faculty. Answer (Branch) (Faculty)
Branch Faculty Output

BID BName HOD FID FName BID BID Bname HOD FID FName
1 CE Shah 101 Raj 1 1 CE Shah 101 Raj
2 ME kc 103 ram 2 2 ME kc 103 ram
To perform a Natural Join there must be one common

attribute (column) between two relations.
Exercise: Write down relational algebra for the following tables/relations
 Relations
 Student (Rno, Sname, Address, city, Mobile)
 Department (Did, Dname)
 Academic (Rno, Did, SPI, CPI, Backlog)
 Guide (Rno, PName, Fid)
 Faculty (Fid, Fname, Subject, Did, Salary)
 List the name of students with their department name having backlog 0.
 List the name of faculties with their department name and salary having salary more than 25000
and belongs to “CE” department.
 List the name of all faculties of “CE” and “ME” department whose salary is more than 50000.
 Display the students name with their project name of all “CE” department’s students whose guide
is “sujan kc”.
 Display the name of faculties with their department name who belongs to “CE” department and
tough “CPU” subject having salary more than 25000.
 List the name of students with their department name doing project “Hackathon” under guide
“Ajay Shah”.
Outer Join
Outer Join
 In natural join some records are missing, if we want that missing records then we
have to use outer join.
Three types of Outer Join

Sr. Outer Join Symbol
1 Left Outer Join
2 Right Outer Join
3 Full Outer Join
To perform a Outer Join there must be one common attribute

(column) between two relations.
Left Outer Join
 Symbol:
 Operation:
 Display all the tuples of the left relation even through there is no matching tuple in the right
relation.
 For such kind of tuples having no matching, the attributes of right relation will be padded with
NULL in resultant relation.
Example Perform Left Outer Join between Student and Result. Answer (Student) (Result)

RollNo Name Branch RollNo SPI RollNo Name Branch SPI
101 Raj CE 101 8 101 Raj CE 8
102 ram ME 103 9 102 ram ME NULL
exercise What is the output of (Result) (Student).

Left Outer Join Example
Example Perform Left Outer Join between Student and Result. (Display RollNo, Name and SPI)
Student Result
RollNo Name Branch RollNo SPI BL
101 Raj CE 101 8 1 RollNo Name Branch SPI BL
102 ram ME 103 9 0 101 Raj CE 8 1
102 ram ME NULL NULL
Answer ∏ RollNo, Name, SPI ((Student) (Result))
Output
RollNo Name SPI
101 Raj 8
102 ram NULL
Right Outer Join
 Symbol:
 Operation:
 Display all the tuples of right relation even through there is no matching tuple in the left relation.
 For such kind of tuples having no matching, the attributes of left relation will be padded with NULL in resultant
relation.
Example Perform Right Outer Join between Student and Result. Answer (Student) (Result)

101 Raj CE 101 8 101 Raj CE 8
102 ram ME 103 9 103 NULL NULL 9

Right Outer Join Example
Example Perform Right Outer Join between Student and Result. (Display RollNo, Name and SPI)
Student Result
101 Raj CE 101 8 1
102 ram ME 103 9 0
Output
RollNo Name SPI
101 Raj 8
103 NULL 9
Full Outer Join
 Symbol:
 Operation:
 Display all the tuples of both of the relations. It also pads null values whenever required. (Left outer join + Right
outer join)
 For such kind of tuples having no matching, it will be padded with NULL in resultant relation.
Example Perform Full Outer Join between Student and Result. Answer (Student) (Result)

101 Raj CE 101 8 101 Raj CE 8
102 ram ME 103 9 102 ram ME NULL
103 NULL NULL 9
Full Outer Join Example
Example Perform Full Outer Join between Student and Result. (Display RollNo, Name and SPI)
Student Result
101 Raj CE 101 8 1
102 ram ME 103 9 0
Output
RollNo Name SPI
101 Raj 8
102 ram NULL
103 NULL 9
Self Join Example
Example Find student id who is enrolled in at least two courses
Study
S_id C_id Since Study1 Study2
101 DBMS 2022 S_id C_id Since S_id C_id Since
102 CN 2021 101 DBMS 2022 101 DBMS 2022
101 OS 2022 102 CN 2021 101 DBMS 2022

101 OS 2022 101 DBMS 2022
101 DBMS 2022 102 CN 2021
102 CN 2021 102 CN 2021
101 OS 2022 102 CN 2022
101 DBMS 2022 101 OS 2022
102 CN 2021 101 OS 2022
101 OS 2022 101 OS 2022
Answer
∏ Study1._id
((Study1) (Study2))study1.S_id = study2.S_id and study1.C_id <> study2.C_id
Study1 Study2
S_id C_id Since S_id C_id Since
101 DBMS 2022 101 DBMS 2022
102 CN 2021 101 DBMS 2022 Study1 Study2
101 OS 2022 101 DBMS 2022 S_id C_id Since S_id C_id Since
101 DBMS 2022 102 CN 2021 101 OS 2022 101 DBMS
102 CN 2021 102 CN 2021 101 DBMS 2022 101 OS 2022
101 OS 2022 102 CN 2022
101 DBMS 2022 101 OS 2022
102 CN 2021 101 OS 2022 Output
101 OS 2022 101 OS 2022 101

Employee(Eid, tname, managerid)
Display the name of manager name from above table
E_id Ename managerid E_id Ename managerid
1 Raj 1 1 Raj 1
E_id Ename managerid 2 ram 1 1 Raj 1

1 Raj 1 3 Jay 3 1 Raj 1
2 ram 1 1 Raj 1 2 ram 1
3 Jay 3 2 ram 1 2 ram 1
4 rita 3 3 Jay 3 2 ram 1
1 Raj 1 3 Jay 3
2 ram 1 3 Jay 3
3 Jay 3 3 Jay 3
((Employee1) (Employee2))employee1.E_id = emloyee2.E_id and employee1.eid = employee2.managerid

∏ employee2.ename
1 Raj 1 1 Raj 1
2 ram 1 2 ram 1
3 Jay 3 3 Jay 3
4 rita 3 4 rita 3

1 Raj 1 1 Raj 1
3 jay 3 3 jay 3
EQUI Join Example
Example Find the employee name who worked in a department having location same as their address
Employee Department
D_id Location E_id Employee Department
E_id Ename Address
101 Ram Balaju 01 Kalanki 103 E_id Ename Address D_id Location E_id
02 Balkhu 101 101 Ram Balaju 01 Kalanki 103

102 Shyam Kalimati
03 chabahil 102 102 Shyam Kalimati 01 Kalanki 103
103 Bharat kalanki
103 Bharat kalanki 01 Kalanki 103
101 Ram Balaju 02 Balkhu 101
102 Shyam Kalimati 02 Balkhu 101
103 Bharat kalanki 02 Balkhu 101
101 Ram Balaju 03 chabahil 102
102 Shyam Kalimati 03 chabahil 102
103 Bharat kalanki 03 chabahil 102

Answer
∏ ((Employee)
Ename
(Department))employee.E_id = Department.E_id and employee.address = department.location
Employee Department
E_id Ename Address D_id Location E_id
Employee Department
101 Ram Balaju 01 Kalanki 103
E_id Ename Address D_id Location E_id
102 Shyam Kalimati 01 Kalanki 103
101 Ram Balaju 02 Balkhu 101
102 Shyam Kalimati 02 Balkhu 101
103 Bharat kalanki 02 Balkhu 101
101 Ram Balaju 03 chabahil 102
102 Shyam Kalimati 03 chabahil 102
103 Bharat kalanki 03 chabahil 102
Output
Bharat
Consider the relational database given below and give an expression in the relational algebra:
Employee (E_id, E-name, salary), Department (D_id, D-name, budget, E_id)
I. Find the names of all employees in this database who have higher salary than the budget of
department.
Consider the relational database given below and give an expression in the relational algebra:
Employee (person-name, street, city) , Works (person-name, company-name, salary)
Company (company-name, city) , Manages (person-name, manager-name)
I. Find the names of all employees in this database who live in the same city as the company for
which they work.
Set Operators
Set Operators
 Set operators combine the results of two or more queries into a single result.
Three types of Set Operators

Sr. Set Operator Symbol
1 Union U
2 Intersect / Intersection ∩
3 Minus / Set difference −
Conditions Set operators will take two or more queries as input, which must be union-compatible.
• Both queries should have same (equal) number of columns

• Corresponding attributes should have the same data type
or domain
Conditions to perform Set Operators
Conditions-1 Both queries should have same (equal) number of columns.
Student Faculty Student Faculty

RNo Name Dept SPI FId Name Dept RNo Name Dept FId Name Dept
101 Raj CE 8 101 kc CE 101 Raj CE 101 kc CE
102 ram ME 9 102 Shah ME 102 ram ME 102 Shah ME
103 Jay CE 9 103 singh ME 103 Jay CE 103 singh ME
Conditions-2 Corresponding attributes should have the same data type.
Student Faculty Student Faculty

RNo Name Dept SPI FId Name Dept Sub RNo Name Dept SPI FId Name Dept Exp
101 Raj CE 8 101 kc CE DS 101 Raj CE 8 101 kc CE 5
102 ram ME 9 102 Shah ME DBMS 102 ram ME 9 102 Shah ME 3
103 Jay CE 9 103 singh ME NM 103 Jay CE 9 103 singh ME 4
Set Operators [exercise]
exercise Check whether following tables are compatible or not:
• A: (First_name(char), Last_name(char), Date_of_Birth(date))

• B: (FName(char), LName(char), PhoneNumber(number))
Χ (Not compatible) Both tables have 3 attributes but third attributes datatype is different.
• A: (First_name(char), Last_name(char), Date_of_Birth(date))

• B: (FName(char), LName(char), DOB(date))
 (Compatible) Both tables have 3 attributes and of same data type.
• Person (PersonID, Name, Address, Hobby)

• Professor (ProfessorID, Name, OfficeAddress, Salary)
• (Not compatible) Both tables have 4 attributes but forth attributes datatype is different.
∏ Name, Address (Person) & ∏ Name, OfficeAddress (Professor)
• (Compatible) Both tables have 2 attributes and of same data type.
Union Operator
 Symbol: U
 Notation: Relation-1 (R1) U Relation-2 (R2) OR Algebra-1 U Algebra-2
 Operation:
 It displays all the tuples/records belonging to the first relation (left relation) or the second relation (right relation) or
both.
 It also eliminates duplicate tuples (tuples present in both relations appear once).
Example Perform Union between Customer and Employee. Answer (Customer) U (Employee)
Customer Employee Output

Name Name Name
Raju ram Manoj
Suresh Suresh ram
ram Manoj Raju
Suresh
exercise Is there any difference in the output if we swap the tables in Union operator. (Employee) U
(Customer).
Intersect/ Intersection Operator
 Symbol: ∩
 Notation: Relation-1 (R1) ∩ Relation-2 (R2) OR Algebra-1 ∩ Algebra-2
 Operation:
 It displays all the tuples/records belonging to both relations. OR
 It displays all the tuples/records which are common from both relations.
Example Perform Intersection between Customer and Employee.Answer (Customer) ∩ (Employee)

Name Name Name
Raju ram ram
Suresh Suresh Suresh
ram Manoj
exercise Is there any difference in the output if we swap the tables in Intersection. (Employee)
∩ (Customer).
Minus/ Set difference Operator
 Symbol: −
 Notation: Relation-1 (R1) − Relation-2 (R2) OR Algebra-1 − Algebra-2
 Operation:
 It displays all the tuples/records belonging to the first relation (left relation) but not in the second relation (right
relation).
Example Perform Set difference between Customer and Employee. Answer (Customer) − (Employee)
Name Name Name
Raju ram Raju
Suresh Suresh
ram Manoj
exercise Is there any difference in the output if we swap the tables in Set difference. (Employee)
− (Customer).
Union Operators Example
Example Display Name of person who are either employee or customer.
Customer Employee
ID Name Balance ID Name Dept Salary
1 Raju 10000 2 Suresh CE 8000
2 Suresh 20000 3 Manoj ME 9000
Answer ∏ Name (Customer) U ∏ Name (Employee)
Output
Name
Manoj
Raju
Suresh
Intersect/ Intersection Operators Example
Example Display Name of person who are employee as well as customer.
Customer Employee
Answer ∏ Name (Customer) ∩ ∏ Name (Employee)
Output
Name
Suresh
Minus/ Set difference Operators Example
Example Display Name of person who are employee but not customer.
Customer Employee
Answer ∏ Name (Employee) − ∏ Name (Customer)
Output
Name
Manoj
Minus/ Set difference Operators Example
Example Display Name of person who are customer but not employee.
Customer Employee
Answer ∏ Name (Customer) − ∏ Name (Employee)
Output
Name
Raju
Division Operator
Division Operator
 Symbol: ÷ (Division)
 Notation: Relation1 (R1) ÷ Relation2 (R2) OR Algebra1 ÷ Algebra2
 Condition:
 Attributes of relation2/algebra2 must be a proper subset of attributes of relation1/algebra1.
 Operation:
 The output of the division operator will have attributes =
All attributes of relation1 – All attributes of relation2
 The output of the division operator will have tuples =
Tuples in relation1, which are associated with the all tuples of relation2.
Division Operator Example
Example Perform Division operation between Student and Subject. Answer (Student) ÷ (Subject)
Student Subject Output

Name Subject Subject Name
Raj DBMS DBMS Rohit
Raj DS DS Suresh
ram DS NM
ram NM
Rohit DBMS
Rohit DS
Rohit NM
Suresh DBMS
Suresh NM
Suresh DS
A B1 B2 B3 B4
Sno PNo PNo PNo PNo PNo
S1 P1 P2 P2 P1 P2
S1 P2 P4 P2 P5
S1 P3 P4
S1 P4 Algebra (A) ÷ (B1) Algebra (A) ÷ (B2) Algebra (A) ÷ (B3) Algebra (A) ÷ (B4)
S2 P1
Output Output Output Output
S2 P2
SNo SNo SNo SNo
S3 P2
S1 S1 S1
S4 P2
S2 S4
S4 P4
S3
S5 P4
S4
Example List the name of students doing a project in all technologies.
Student Project
RNo Name Technology TID Technology
101 Raj .NET 1 .NET
101 Raj PHP 2 PHP
102 ram .NET 3 Android
102 ram PHP 4 iPhone
102 ram iPhone

Answer ∏ Name, Technology (Student) ÷ ∏ Technology (Project)
102 ram Android
103 Rohit Android Output
104 Suresh .NET Name
104 Suresh iPhone

ram
104 Suresh Android

Rename Operator
Rename Operator
 Symbol: ρ (Rho)
 Notation: ρA (X1,X2….Xn) (Relation)

 Operation:
 The rename operation is used to rename the output relation.
 The result of rename operator are also relations with new name.
 The original relation name can not be changed when we perform rename operation on any relation.
 How to use:
 ρ x (E)
Returns a relation E under a new name X.
 ρ A1, A2. …,An (E)
Returns a relation E with the attributes renamed to A1, A2, …., An.
 ρ x(A1, A2. …,An) (E)
Returns a relation E under a new name X with the attributes renamed to A1, A2, …., An.
Rename Operator Example
Example Rename table Example Rename attributes
Student Student
RNo Name CPI Rno Name CPI

101 Raj 8 101 Raj 8
102 ram 9 102 ram 9
103 Jay 7 103 Jay 7
Algebra ρPerson (Student) Algebra ρ(RollNo, StudentName, SPI) (Student)
Person Student
RNo Name CPI RollNo StudentName SPI

101 Raj 8 101 Raj 8
102 ram 9 102 ram 9
103 Jay 7 103 Jay 7

Example Rename table and attributes both Example Rename particular attributes
Student Student
Rno Name CPI Rno Name CPI
101 Raj 8 101 Raj 8
102 ram 9 102 ram 9
103 Jay 7 103 Jay 7
Algebra ρPerson (RollNo, StudentName) (∏ RNo, Name (Student)) Algebra ρStudentName / Name (Student)
Person Student
RollNo StudentName Rno StudentName CPI
101 Raj 101 Raj 8
102 ram 102 ram 9
103 Jay 103 Jay 7
Example Find out maximum CPI from student table. Step-1 ρA (Student) X ρB (Student)
Student Output-1
Rno Name CPI A.Rno A.Name A.CPI B.Rno B.Name B.CPI

101 Raj 8 101 Raj 8 101 Raj 8
102 ram 9 101 Raj 8 102 ram 9
103 Jay 7 101 Raj 8 103 Jay 7
102 ram 9 101 Raj 8

Step-2
σA.CPI<B.CPI (ρA (Student) X ρB (Student))
102 ram 9 102 ram 9
Output-2 102 ram 9 103 Jay 7
A.Rno A.Name A.CPI B.Rno B.Name B.CPI 103 Jay 7 101 Raj 8
101 Raj 8 102 ram 9 103 Jay 7 102 ram 9
103 Jay 7 101 Raj 8 103 Jay 7 103 Jay 7
103 Jay 7 102 ram 9
Example Find out maximum CPI from student table.
Student
Step-3
∏ A.CPI (σA.CPI<B.CPI (ρA (Student) X ρB (Student)))
Rno Name CPI
101 Raj 8 Output-3
102 ram 9 A.CPI

8
103 Jay 7
7
Step-2
σA.CPI<B.CPI (ρA (Student) X ρB (Student))
Output-2
A.Rno A.Name A.CPI B.Rno B.Name B.CPI

101 Raj 8 102 ram 9
103 Jay 7 101 Raj 8
103 Jay 7 102 ram 9

Example Find out maximum CPI from student table.
Student
Step-3
∏ A.CPI (σA.CPI<B.CPI (ρA (Student) X ρB (Student)))
Rno Name CPI
Output-3
101 Raj 8
A.CPI
102 ram 9
8
103 Jay 7
7
Step-4
∏ CPI (Student) − ∏ A.CPI (σA.CPI<B.CPI (ρA (Student) X ρB (Student)))
Student Output-3 Output

CPI A.CPI CPI
8 − 8 = 9
9 7
7
exercise What is the output of following relational algebra for the below mentioned tables:
Customer Employee
Algebra-1 ∏ ID, Name (Customer) U ∏ ID, Name (Employee)
Algebra-2 ∏ ID, Name, Balance (Customer) U ∏ ID, Name, Salary (Employee)
Algebra-3 ∏ ID, Name (Customer) ∩ ∏ ID, Name (Employee)
Algebra-4 ∏ ID, Name, Balance (Customer) ∩ ∏ ID, Name, Salary (Employee)

exercise What is the output of following relational algebra for the below mentioned tables:
Customer Employee
ID Name ID Name
1 Raju 2 Suresh
2 Suresh 3 Manoj
ID Name
Algebra-1 ∏ ID, Name (Customer) − ∏ ID, Name (Employee) 1 Raju
Algebra-2 ∏ ID, Name, Balance (Customer) − ∏ ID, Name, Salary (Employee)
Algebra-3 ∏ ID, Name (Employee) − ∏ ID, Name (Customer)
Algebra-4 ∏ ID, Name, Balance (Employee) − ∏ ID, Name, Salary (Customer)

Aggregate Functions
Aggregate Functions
 Symbol: g or G
 Notation: g function-name(column), function-name(column), …, function-name(column) (Relation)
 Operation:
 It takes a more than one value as input and returns a single value as output (result).
 Aggregate functions are:
 Sum (It returns the sum (addition) of the values of a column.)
 Max (It returns the maximum value for a column.)
 Min (It returns the minimum value for a column.)
 Avg (It returns the average of the values for a column.)
 Count (It returns total number of values in a given column.)
Aggregate Functions Example
Student
Example Find out sum of CPI of all students. Output
Rno Name Branch Semester CPI
sum
101 Ramesh CE 3 9 Answer g sum(CPI) (Student)
73
102 Mahesh EC 3 8
103 Suresh ME 4 7 Example Find out maximum & minimum CPI. Output
104 Amit EE 4 8 max min

Answer g max(CPI), min(CPI) (Student)
105 Anita CE 4 8 9 7
106 Reeta ME 3 7 Example Count the number of students. Output

107 Rohit EE 4 9 count
Answer g count(Rno) (Student)
108 Chetan CE 3 8 9
109 Rakesh CE 4 9
Example Find out average of CPI of all students. Output
avg
Answer g avg(CPI) (Student)
8.11
QBE
 It is the database query language for databases. It is the first graphical
query language using visual tables where user will enter commands,
example elements and conditions.
Relational Algebra [Exercise]
 Write down relational algebras for the following table:
 Employee (person-name, street, city)
 Works (person-name, company-name, salary)
 Company (company-name, city)
 Managers (person-name, manager-name)
 Find the names of all employees who work for “TCS”.

 Find the names and cities of residence of all employees who work for “Infosys”.
 Find the names, street and city of residence of all employees who work for “ITC” and earn more than $10,000 per
annum.
 Find the names of all employees in this database who live in the same city as the company for which they work.
 Find the names of all employees working in “TCS” who earn more than 25000 and less than 40000.
 Find the name of employee whose manager is “Ajay Patel” and salary is more than 50000.
 Display the name of employee with street, city, company name, salary and manager name staying in “Rajkot” and
working in “Ahmedabad”.
 Find maximum, minimum and average salary of all employee.
 Find out the total number of employee.
Questions asked in TU
1. Define Super key, Primary key, Candidate key and Alternate key.
2. Explain following Relational Algebra Operation with example.
I. Selection
II. Projection
III. Cross Product
IV. Joins (Inner Join, Outer Joins)
V. Set operators
3. Explain different aggregate functions with example.
Questions asked in TU [Relational Algebra]
4. Consider the following relational database, where the primary keys are underlined. Give an expression in the
relational algebra to express each of the following queries
 employee (ssn, name, dno, salary, hobby, gender)
 department (dno, dname, budget, location, mgrssn)
 works_on (ssn, pno)
 project (pno, pname, budget, location, goal)
I. List all pairs of employee names and the project numbers they work on.
II. List out department number, department name and department budget.
III. List all projects that Raj Yadav works on by project name.
IV. List the names of employees who supervise themselves.
5. Consider the following relational database, where the primary keys are underlined.
Give an expression in the relational algebra to express each of the following queries
 course (course-id, title, dept_name, credits)
 instructor (id, name, dept_name, salary)
 section (course-id, sec-id, semester, year, building, room_no, time_slot_id)
 teaches (id, course-id, sec-id, semester, year)
I. Find the name of all instructors in the physics department.

II. Find all the courses taught in the fall 2009 semester but not in Spring semester.
III. Find the names of all instructors in the Comp. Sci. department together with the course titles
of all the courses that the instructors teach.
IV. Find the average salary in each department.
6. Consider the following relations and write an relational algebra:
 EMP (empno, ename, jobtitle, managerno, hiredate, sal, commission, deptno)
 DEPT (deptno, dname, location)
I. Find the Employees working in the department number10, 20, 30 only.
II. Find Employees whose names start with letter A or letter a.
III. Find Employees along with their department name.
IV. Find the Employees who are working in Smith's department
V. Find the Employees who get salary more than Allen’s salary.
VI. Display employees who are getting maximum salary in each department.
VII. Find list of employees whose hire date is on or before 1-April-18.
7. Consider the relational database given below and give an expression in the relational algebra:
 Employee (person-name, street, city) , Works (person-name, company-name, salary)
 Company (company-name, city) , Manages (person-name, manager-name)
I. Find the names of all employees in this database who live in the same city as the company for which they work.
II. Find the names, street address, and cities of residence of all employees who work for HCL and earn more than
$10,000 per annum.
8. The relational database schema is given below and write the relational algebra expressions for the given queries.
 employee (person-name, street, city)
 works (person-name, company-name, salary)
 company (company-name, city)
 manages (person-name, manager-name)
I. Find the names of all employees who work for First Bank Corporation.
II. Find the names and cities of residence of all employees who work for First Bank Corporation.
III. Find the names, street address, and cities of residence of all employees who work for First Bank Corporation and
earn more than $10,000 per annum.
IV. Find the names of all employees in this database who do not work for First Bank Corporation.
Assignment
1. Define Super key, Primary key, Candidate key and Alternate key.
2. Explain following Relational Algebra Operation with example.
I. Selection
II. Projection
III. Cross Product
IV. Joins (Inner Join, Outer Joins)
V. Set operators
3. Explain different aggregate functions with example.
Questions of [Relational Algebra]
 employee (ssn, name, dno, salary, hobby, gender)
 department (dno, dname, budget, location, mgrssn)
 works_on (ssn, pno)
 project (pno, pname, budget, location, goal)
I. List all pairs of employee names and the project numbers they work on.
II. List out department number, department name and department budget.
III. List all projects that Raj Yadav works on by project name.
IV. List the names of employees who supervise themselves.
 course (course-id, title, dept_name, credits)
 instructor (id, name, dept_name, salary)
 section (course-id, sec-id, semester, year, building, room_no, time_slot_id)
 teaches (id, course-id, sec-id, semester, year)
I. Find the name of all instructors in the physics department.

II. Find all the courses taught in the fall 2009 semester but not in Spring semester.
III. Find the names of all instructors in the Comp. Sci. department together with the course titles of all the courses that
the instructors teach.
IV. Find the average salary in each department.
6. Consider the following relations and write an relational algebra:
 EMP (empno, ename, jobtitle, managerno, hiredate, sal, commission, deptno)
 DEPT (deptno, dname, location)
I. Find the Employees working in the department number10, 20, 30 only.
II. Find Employees whose names start with letter A or letter a.
III. Find Employees along with their department name.
IV. Find the Employees who are working in Smith's department
V. Find the Employees who get salary more than Allen’s salary.
VI. Display employees who are getting maximum salary in each department.
VII. Find list of employees whose hire date is on or before 1-April-18.
7. Consider the relational database given below and give an expression in the relational algebra:
 Employee (person-name, street, city) , Works (person-name, company-name, salary)
 Company (company-name, city) , Manages (person-name, manager-name)
I. Find the names of all employees in this database who live in the same city as the company for which they work.
II. Find the names, street address, and cities of residence of all employees who work for HCL and earn more than
$10,000 per annum.
8. The relational database schema is given below and write the relational algebra expressions for the given queries.
 employee (person-name, street, city)
 works (person-name, company-name, salary)
 company (company-name, city)
 manages (person-name, manager-name)
I. Find the names of all employees who work for First Bank Corporation.
II. Find the names and cities of residence of all employees who work for First Bank Corporation.
III. Find the names, street address, and cities of residence of all employees who work for First Bank Corporation and
earn more than $10,000 per annum.
IV. Find the names of all employees in this database who do not work for First Bank Corporation.
teacher (tid, tname, managerid)
Display tid tname and manager name from above table
1 Raj 1 1 Raj 1
E_id Ename managerid 2 ram 1 1 Raj 1

1 Raj 1 3 Jay 2 1 Raj 1
2 ram 1 1 Raj 1 2 ram 1
3 Jay 2 2 ram 1 2 ram 1
3 Jay 2 2 ram 1
1 Raj 1 3 Jay 2
2 ram 1 3 Jay 2
3 Jay 2 3 Jay 2
∏ ((Employee1)
Eemployee1.eidmployee1.name,employee2.ename
(Employee2))employee1.E_id = emloyee2.E_id and employee1.managerid = employee2.managerid
Thank You

Dbms Chapter 3

Uploaded by

Copyright:

Available Formats

You might also like

Dbms Chapter 3

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Dbms Chapter 3

Uploaded by

Copyright:

Available Formats

 Database Management Systems (DBMS)

Sr. Lec. Sujan Shrestha

Cardinality = No of tuples (7)

Super Key Super Key

EnrollNo RollNo Branch Sem SPI Name BL

Candidate Key Candidate Key

190540107001 101 CE 3 8 Raju 0

Candidate Key Candidate Key

EnrollNo RollNo Branch Sem SPI Name BL

Primary Key Alternate Key

Candidate Key Candidate Key

EnrollNo RollNo Branch Sem SPI Name BL

1 Simran ktm c1 DBMS 1

Referencing table Referenced table

Referencing table Referenced table

2 table, where table with m relation

Roll No Name Age Roll_no C_id C_id Nmae credit

not possible to merge

Answer σBranch=‘BCA’ V Branch=‘ME’ (Student)

Answer σSPI>7 Λ SPI<9 (Student)

 Notation: ∏ attribute set (Relation)

Step-1 σBranch=‘ME’ (Student) Answer ∏ RollNo, Name, Branch (σBranch=‘ME’ (Student))

Step-1 σSPI>8 (Student)

 Write down the relational algebra for the employee Employee

Student Result Output

Answer ∏ RNo, Name, Branch (Student) X ∏ RNo, SPI, BL (Result)

Steps performed in Natural Join

Student Result Output

Step:1 Perform Cross Product Step:2 Removes inconsistent tuples

Branch Faculty Output

To perform a Natural Join there must be one common

Three types of Outer Join

To perform a Outer Join there must be one common attribute

Student Result Output

exercise What is the output of (Result) (Student).

Student Result Output

exercise What is the output of (Result) (Student).

Answer ∏ RollNo, Name, SPI ((Student) (Result))

Student Result Output

Answer ∏ RollNo, Name, SPI ((Student) (Result))

101 DBMS 2022 S_id C_id Since S_id C_id Since

102 CN 2021 101 DBMS 2022 101 DBMS 2022

101 OS 2022 102 CN 2021 101 DBMS 2022

101 OS 2022 101 OS 2022 101

E_id Ename managerid 2 ram 1 1 Raj 1

((Employee1) (Employee2))employee1.E_id = emloyee2.E_id and employee1.eid = employee2.managerid

E_id Ename managerid E_id Ename managerid

02 Balkhu 101 101 Ram Balaju 01 Kalanki 103

101 Ram Balaju 02 Balkhu 101

102 Shyam Kalimati 02 Balkhu 101

103 Bharat kalanki 02 Balkhu 101

101 Ram Balaju 03 chabahil 102

102 Shyam Kalimati 03 chabahil 102

103 Bharat kalanki 03 chabahil 102

101 Ram Balaju 02 Balkhu 101

102 Shyam Kalimati 02 Balkhu 101

103 Bharat kalanki 02 Balkhu 101

101 Ram Balaju 03 chabahil 102