Question 8557 – Transactions

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?

Correct Answer: D

Question 4 Explanation:

Option: A

– Polygraph contains cycle. So, not a conflict serializable.
Option: B

-Cyclic
Option: C

– Cyclic
Option: D

– Acyclic, so conflict serializable.

r₁ (x); r₂ (x); w₁ (x); r₃ (x); w₂ (x)

r₂ (x);r₁ (x);w₂ (x);r₃ (x);w₁ (x)

r₃ (x);r₂ (x);r₁ (x);w₂ (x);w₁ (x)

r₂ (x);w₂ (x);r₃ (x);r₁ (x);w₁ (x)

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments