retagged by
335 views
1 votes
1 votes

Which of the following schedules are conflicts serializable?

  1. S1:   $r1$ $\left ( A \right )$, $r1$$\left ( B \right )$, $w2$$\left ( A \right )$, $r3$ $\left ( A \right )$, $w1$$\left ( B \right )$, $w3$ $\left ( A \right )$, $r2$ $\left ( B \right )$, $w2$$\left ( B \right )$
  2. S2 :  $r1$$\left ( A \right )$, $r2$$\left ( A \right )$, $r3$ $\left (B \right )$, $w1$$\left ( A \right )$, $r2$ $\left ( C \right )$, $r2$ $\left (B \right )$, $w2$ $\left (B \right )$, $w1$$\left ( C \right )$
  3. S3:   $w3$$\left ( A \right )$ , $r1$ $\left ( A \right )$, $w1$ $\left (B \right )$, $r2$$\left (B \right )$, $w2$ $\left ( C \right )$, $r3$, $\left ( C \right )$
  1. $S1,S3$ only
  2. $S2,S3$ only
  3. $S1,S2$ only
  4. $S1, S2, S3$
retagged by

1 Answer

Best answer
2 votes
2 votes
S1: Precedence graph , No cycle: So conflict serializable.
S2:  Precedence graph ,  No cycle: Conflict serializable.
S3: Precedence graph , Cycle: Not conflict serializable
selected by
Answer:

Related questions

1 votes
1 votes
1 answer
2
3 votes
3 votes
2 answers
3
2 votes
2 votes
1 answer
4
Bikram asked Jan 24, 2017
334 views
Consider the following relation instance:ABC123235143236 $$\begin{array}{|c|c|c|} \hline A & B &C \\ \hline 1 & 2 & 3 \\ \hline 2 & 3 & 5 \\ \hline 1 & 4 & 3 \\ \hlin...