Assignment 5
Due date: Thursday, April 23, 11:59PM.
NOTES:
- Start early!
- This is an individual assignment; no groups allowed.
This assignment is meant to give you practice with ER Modelling, Relational Database Design and Transaction Concurency COntrol.
Problem 1:
- Solve Exercise 7.20 page 319 in the textbook.
- Solve Exercise 7.21 page 319 in the textbook.
Problem 2:
- Give the Relation Schema for your solution to Exercise 7.20. Include all the constraints.
- Give the Relation Schema for your solution to Exercise 7.21. Include all the constraints.
Problem 3:
Consider the following classes of schedules: serializable, conflict serializable, and view-serializable. For each of the
following schedules, state which of the preceding classes it belongs to. If you cannot decide whether a schedule belongs in a certain class, explain briefly.
- T1:R(X), T2:R(X), T1:W(X), T2:W(X).
- T1:W(X), T2:R(Y), T1:R(Y), T2:R(X).
- T1:R(X), T2:R(Y), T3:W(X), T2:R(X), T1:R(Y).
- T1:R(X), T1:R(Y), T1:W(X), T2:R(Y), T3:W(Y), T1:W(X), T2:R(Y).
Deliverables
- a document with the solutions to the above problems.
Upload the document in blackboard.