Consider the schedule S: r1(x),r3(y),r3(x),w1(x),c1,w2(y),r2(x),w3(y),c2,c3
Check whether the given schedule is conflict-serializable or not. Explain how.
Answers
Answered by
0
Answer:
Explanation: Schedule is not recoverable, not cascadeless and not conflict serializable
Similar questions
English,
1 month ago
English,
1 month ago
Accountancy,
2 months ago
Math,
9 months ago
Social Sciences,
9 months ago