# No. Of serial schedules view equal to S

1.1k views

No. Of serial schedules view equal to S

S: R1(A), R3(D), W1(B), R2(B), W3(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) .

If possible please provide detailed solutions.

0
1

let me explain :

dependecies :

FOR FINAL WRITE

•  B = T5  here condition is (T1, T3)-> T5
• E = T4 NO RESTRICTION
• C = T2 NO RESTRICTION

• A= T1 NOT MATTER SINCE NO WRITE ON A
• D = T3 NO MATTER SINCE NO WRITE ON D

• B = T1-> T2 ( NO WRITE COME IN BETWEEN I.E. T3 AND T5)
• B = T3-> T4 ( NO WRITE COME IN BETWEEN I.E. T1 AND T5)
• C = T2 -> T5
• E= T4-> T5

NOW CONDITIONS :

T5 MUST BE LAST

T1-> T2 AND T3-> T4 COME ADJACENT ONLY

SO T1-> T2-> T3-> T4-> T5 AND T3-> T4->T1->T2-> T5

0
@Ashwin here W3(B) extra present. It's totally different question.

@Anu007

Actually for ans. I am also confused about this I am getting only one. But ans is 2.

1,2,3,4,5. But ans says that one extra which is 3, 4, 1,2,5.

0
CHECK NOW
0
plz any one gives correct method for this
0

@Anu007

view eqiv rules are maintained as far as i see this...

LET ME EXPLAIN :

LOOK AT DEPENDENCIES :

FOR FINAL WRITE

•  B = T5  here condition is (T1, T3)-> T5
• E = T4 NO RESTRICTION
• C = T2 NO RESTRICTION

• A= T1 NOT MATTER SINCE NO WRITE ON A
• D = T3 NOT MATTER SINCE NO WRITE ON D

• B = T1-> T2 ( NO WRITE COME IN BETWEEN I.E. T3 AND T5)
• B = T3-> T4 ( NO WRITE COME IN BETWEEN I.E. T1 AND T5)
• C = T2 -> T5
• E= T4-> T5

NOW CONDITIONS :

T5 MUST BE LAST

T1-> T2 AND T3-> T4 COME ADJACENT ONLY

SO T1-> T2-> T3-> T4-> T5 AND T3-> T4->T1->T2-> T5

0
When we use T3 --> T2 which generates new updated read (WR)problem. So how can we say it would be view serializable ?
0

BEFORE T2 READ WE WRITE IT BY T2 SEE T1->T2

SO EFFECT OF T3 IS LOST

0

Which of following is the Problem for data item B

0

IN VIEW SERIAL ONLY LAST WRITE MATTER SO  T3 -> T5 NO ISSUE. SAME T3->T1 NO ISSUE

YOU ARE CHECKING CONFLICT SERIALIZABLE.

0
That's means conflict problem (WW, WR RW for same data item) is not same as view problem or serializable problem ?
0
YES SOME RESTRICTION ARE  REMOVED FROM VIEW , IN COMPARISION TO CONFLICT.

LIKE WW.
0
For above image all are conflict pairs?
0

Is is true or not?

(RW , WR conflict pair is same precedence for two schedule S and S') iff  (intial read and updated read same for S and S')

But only implication for

(WW conflict pair) --> (final write)

0

@ Anu007 If No. Of serial schedules conflict equal to S was asked then just this one right, T1-> T2-> T3-> T4-> T5

## Related questions

1
4.8k views
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
How many Conflict Serializable and View serializable schedules for the Schedule given below $S:r_1(A),w_1(B),w_1(C),r_2(A),w_2(B),w_2(C)$ To both my answer comes to be 7. Is it correct?
Suppose we have a schedule containing two transactions  as shown- $\begin{bmatrix} T1 & T2 \\ R(A) & \\ W(A) & \\ & R(A) \\ & W(A) \\ R(B)& \\ W(B)& \\ & R(B) \\ & W(B) \end{bmatrix}$   We will proceed to create the polygraph for the ... schedule. If we create separate polygraphs, for A we will get t1->t2, and for B we will get t1->t2.. Same graph will be obtained if we draw a single polygraph