Conflict Serializability T1 T2 T3 R(X) R(Y) R(Z) By using a dependency graph determine whether R(X) W(X) this schedule is R(Y) W(Y) R(Y) conflict serializable. If it is conflict R(X) W(Z) serializable, what is the equivalent serial schedule?
Added by Lorraine P.
Close
Step 1
The dependency graph for the given schedule is as follows: T1: R(X) -> W(X) T2: R(Y) -> W(Y) T3: R(Z) Show more…
Show all steps
Your feedback will help us improve your experience
Deepak Kumar and 77 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Consider the data given in the above question. Draw the precedence graph for $S_{2}$ and state whether each schedule is serializable or not. If a schedule is serializable, which of the following is equivalent serial schedule? $S_{2}: r_{1}(x), r_{2}(z), r_{3}(x), r_{1}(z), r_{2}(y), r_{3}(y), w_{1}(x), w_{2}(z)$, $w_{3}(y), w_{2}(y)$ (A) $r_{3}(x), r_{3}(y), w_{3}(y), r_{1}(x), r_{1}(z), w_{1}(x), r_{2}(z), r_{2}(y)$, $w_{2}(z), w_{2}(y)$ (B) $r_{1}^{2}(x), r_{1}(z), w_{1}(x), r_{2}(z), r_{2}(y), w_{2}(z), w_{2}(y), r_{3}(x)$ $r_{3}(y), w_{3}(y)$ (C) $r_{2}(z), r_{2}(y), w_{2}(z), w_{2}(y), r_{3}(x), r_{3}(y), w_{3}(y), r_{1}(x)$ $r_{1}(z), w_{1}(x)$ (D) $r_{2}(z), r_{2}(y), w_{2}(z), w_{2}(y), r_{1}(x), r_{1}(z), w_{1}(x), r_{3}(x)$, $r_{3}(y), w_{3}(y)$
Databases
Transaction and Concurrency
Consider the given schedules $S_{1}$ and $S_{2}$ $S_{1}: r_{1}(x), r_{1}(y), r_{2}(x), r_{2}(y), w_{2}(y), w_{1}(x)$ $S_{2}: r_{1}(x), r_{2}(x), r_{2}(y), w_{2}(y), r_{1}(y), w_{1}(x)$ Which schedule is conflict serializable? (A) $S_{1}$ (C) $S_{1}$ and $S$, (B) $S_{2}$ (D) None of these
Consider the following transactions with data items $P$ and $Q$ initialized to ${ }^{4} 0^{\prime}$ : $T_{1}: \operatorname{read}(P)$ $\operatorname{Read}(Q)$ if $p=0$ then $Q=Q+1$ Write $(Q)$ $T_{2}: \operatorname{read}(Q)$ $\operatorname{Read}(P)$ if $Q=0$ then $p=p+1$ Write $(P)$ Any non-serial interleaving of $T_{1}$ and $T_{2}$ for concurrent execution leads to (A) a serializable schedule (B) a schedule that is not conflict serializable (C) a conflict serializable schedule (D) a schedule for which a precedence graph cannot be drawn
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD