Let S be the following schedule of operations of three transactions T1, T2 and…
Let S be the following schedule of operations of three transactions T1, T2 and T3 in a relational database system:
S: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
Consider the statements P and Q below:
P: S is conflict-serializable.
Q: If T2 commits before T1 finishes, then S is recoverable.
Which one of the following choices is correct?
- A.
Both P and Q are true
- B.
P is true and Q is false
- C.
Both P and Q are false
- D.
P is false and Q is true
Attempted by 40 students.
Sign up free to check your answer
Sign up freeLoading lesson…