PKM Educational Trust

R.R. Institute of Technology\iovt. of Kamalaka

AMiliated to VTU Belyaum and Approved by AITE, New Delh1, Roognved
Aceredited by NAAC with "A+
Raja Reddy Layout, Chikkabanavara, Bengaluru 560 090

Academic Year 2024-25

Batch 2023-2027
Year/Semester 2nd Year/4h Semester
Course Name Database Management system
Course Code BCS403
Name of the Instructor Shruthi KN

sl. No Assignment Questions COs

1 |Discuss how to characterize schedules based on recoverability in a database system. CO4

Explain the conditions under which aschedule s considered recoverable, providing

relevant cxamples.
2 Define serializability in the context of database schedules. Provide criteria to determine if co4
given schedule is serializable, and illustrate with examples.
With a neat diagram explain transaction states and additional operations. Co4

|Illustrate why concurency control is needced with an cexample.. |COS

Demonstrate the System log in databasc transaction. COS

6
What is document based NOSQL systems? Basic operations CRUD in Mongo DB. CO6
What is NOSQL? Explain the CAP theom. cO6

8 Consider two sets of functional dependency. F={A->C, AC->D, E->AD, E->H, E={A CO3
CD, E->AH}. Are they equivalent?
9
Explain how deadlock and starvation problem occur? Explain how these problems can be co5
resolved.

10 What is NOSQL graph database? Explain Neo4j. CO6

 PKM Educational Trust ®

R.R. Institute of" Nnnology

Amliated to VIU Helyaum and Approned by T Rengnvct ovt of Karalaku

Aceredited by NAAC with A+
Raja Reddy Layout, Chikkabanavara, Bengaluru S60 090

Academic Year 2024-25

Batch 2023-2027
Year/Semester 2nd Yearj4m Semester
Course Name Database Managenment system
|Course Code BCS403
Name of the Instructor Shruthi KN

SI. No Assignment Questions cos

1 Discuss how to characterize schedules based on recoverability in a database system. |co4

Explain the conditions under which a schedule s considered recoverable, providing

relevant examples.
2 Define serializability in the context of database schedules. Provide criteria to determine if co4
given schedule is serializable, and illustrate with examples.
3 |With a neat diagram explain transaction states and additional operations. CO4

llustrate why concurrency control is needed with an example.. COs

Demonstrate the System log in database transaction. cOs

What is document bascd NOSQL systems? Basic operations CRUD in Mongo DB. CO6

What is NOSQL? Explain the CAP theorm. cO6

Consider two sets of functional dependency. F-{A->C,AC->D, E->AD, E->H, E-{A cO3
CD, E-SAH}. Are they equivalent?
Explain how deadlock and starvation problem occur? Explain how these problems can be cos
resolved.
10
What is NOSQL graph database? Explain Neo4j. cO6
 DBMS MODULE 2

Module 2
Relational Model: Relational Model Concepts, Relational Model Constraints and relational
database schemas, Update operations, transactions, and dealing with constraint violations.
Relational Algebra: Unary and Binary relational operations, additional relational operations
(aggregate, grouping etc.) Examples of Queries in relational algebra
Mapping Conceptual Design into a Logical Design: Relational Database Design using ER-to
Relational mapping.

Textbook 1: Ch4.1 to 4.5, 5.1 to 5.3, 6.1 to 6.5, 8.1; Textbook 2: 3.5
RBT: L1, L2, L3

CHAPTER 1

RELATIONAL DATA MODEL AND RELATIONAL DATABASE

CONSTRAINTS
MA

Relational Model Concepts:

The relational modelrepresents the database as a collection of relations.

Informally, each relation resembles a table of values or, to some extent, a flat file
of records.
It is called a flat file because each record has a simple linear or flat structure.
When a relation is thought of as a table of values, each row in the table
represents a ollection of related data values.
A row represents a fact that typically corresponds to a real-world entity or
relationship.
The table name and column names are used to help to interpret the meaning of
the values in each row.
For example, the first table is STUDENT, each row represents facts about a
particular student entity. The column names-Name, Student_number, Class, and
Major-specify how to interpret the data values in each row, based on the
column each value is in.
All values in a column are of the same data type.

In the formal relational model terminology, a row is called a TUPLE, a

columnheader is called an ATTRIBUTE, and the table is called a RELATION.
DEPT OF CSE, SJCIT Page 1 of 56
 DBMS MODULE2

Module 2
relational
Relational Model: Relational Model Concepts, Relational Model Constraints and
database schemas, Update operations, transactions, and dealing with constraint violations.
Relational Algebra: Unary and Binary relational operations, additional relational operations
(aggregate, grouping etc.) Examples of Queries in relational algebra
Mapping Conceptual Design into a Logical Design: Relational Database Design using ER-to
Relational mapping

Textbook 1: Ch4.1 to 4.5, 5.1 to 5.3, 6.1 to 6.5, 8.1; Textbook 2:3.5
RBT: L1, L2, L3

CHAPTER 1

RELATIONAL DATA MODEL AND RELATIONAL DATABASE

CONSTRAINTS
UMA

Relational Model Concepts:

The relational model represents the database as a collection of relations.

Informally, each relation resembles a table of values or, to some extent, aflat file
of records.
It is called a fat île because each record has a simple linear or flat structure.
When a relation is thought of as a table of values, each row in the table
represents a collection of related data values.
A row represents a fact that typically corresponds to a real-world entity or
relationship.
The table name and column names are used to help to interpret the meaning of
the values in each row.
For example, the first table is STUDENT, each row represents facts about a
particular student entity. The column names--Name, Student_number, Class, and
Major-specify how to interpret the data values in each row, based on the
column each value is in.
Allvalues in a column are of the same data type.

In the formal relational model terminology, a row is called aTUPLE, a

columnheader is called an ATTRIBUTE, and the table is called a RELATION.
DEPT OF CSE, SJCIT Page 1 of 56
 Module 5

Concurency Controlin Databases: Two-phase locking techniques for Concurrency control,

Concurrency control based on Timestamp ordering, Multi version Concurrency control techniques,
Validation Concurrency control techniques, Granularity of Data items and Multiple Granularity Locking.
NOSQL Databases and Big Data Storage Systems: Introduction to NOSQL Systems, The CAP
Theorem, Document-Based NOSQL Systems and Mongo DB, NOSQL Key-Value Stores, Column-Based
or Wide Column NOSQL Systems, NOSQL Graph Databases and Neo4j
Textbook 1:Chapter 21.I to 21.5, Chapter 24.1 to 24.6 RBT: LI, L2, L3
SJcIT

Concurrency Control in Databases

Introduction to Concurrency Control

" Purpose of Concurrency Control
To enforce Isolation (through mutual
exclusion) among conflicting
transactions.
To preserve database consistency
through consistency preserving execution of
transactions.
To resolve read-write and
write-write conflicts.
" Example:
- In concurrent execution environment if T1
conflicts with T2 over a data item A,
then the existing concurrency control
decides if T1 or T2 should get the A
other transaction is rolled-back or and if the
waits.
 Module 5
Concurrency Control in Databases: Two-phase locking techniques for Concurrency control,
Concurrency control based on Timestamp ordering, Multi version Concurrency control techniques,
Validation Concurrency control techniques, Granularity of Data items and Multiple Granularity Locking.
NOSQL Databases and Big Data Storage Systems: Introduction to NOSQL Systems, The CAP
Theorem, Document-Based NOSQL Systems and Mongo DB, NOSQL Key-Value Stores, Column-Based
or Wide Column NOSQL Systems, NOSQL Graph Databases and Neo4j

Textbook 1:Chapter 21.l to 21.5, Chapter 24.1 to 24.6 RBT: LI, L2, L3 SJCIT

Concurrency Control in Databases

Introduction to Concurrency Control

" Purpose of Concurrency Control

To enforce Isolation (through mutual exclusion) among conflicting transactions.

execution of
To preserve database consistency through consistency preserving
transactions.

To resolve read-write and write-write conflicts.

" Example:
if T1 conflicts with T2 over a data item A,
- In concurrent execution environment
T1 or T2 should get the Aand if the
then the existing concurrency control decides if
other transaction is rolled-back or waits.