COMP9315 Final Exam The University of New South Wales
COMP9315 DBMS Implementation
Final Exam
DBMS Implementation
[Instructions] [Notes] [PostgreSQL] [C]
[Q1] [Q2] [Q3] [Q4] [Q5] [Q6] [Q7] [Q8]

Question 7 (4 marks)

Consider the following concurrent schedule on three transactions:

T1: R(X) W(X)           R(Y)                W(Y)
T2:           R(Y)           R(X) W(Y)           W(X)
T3:                R(X)                R(Y)           W(X) W(Y)

Assume that all transactions commit successfully, and that no system failures prevent complete update of all changes to the database.

  1. Is the schedule conflict serializable?
    (If you need to draw a graph for this, use a piece of paper or a drawing tool.
    There's no need to submit your drawn graph, but some indication of its structure is required)

  2. Is the schedule view serializable?

Show all working.

Instructions:

End of Question