1,393 views
0 votes
0 votes
How many operations (Read/ Write) can be placed in ‘X’ to make ‘S’, not conflict serializable?

1 Answer

1 votes
1 votes

one read (R2C), two write(W2C) ,      W1(B)  will make the schedule not CS

HOW

IF U DRAW DEPENDENCY GRAPH AS PER OUR SCHEDULE THEN THERE IS AN ARROW FROM

 T1 TO T2.

NOW IF WE PUT SOME VALUE IN PLACE OF X SUCH THAT THERE WILL BE AN ARROW FROM

T2 TO T1.

THEN THERE IS A CYCLE.WHICH LEADS TO NOT CS

NOW THINK:

IN T1 THERE IS W1(C). THEN WHAT VALUE IN PLACE OF X WILL MAKE A DEPENDENCY FROM T2 TO T1

THAT WILLL BE R2(C)   OR    W2(C)

AND 

IN T2 THERE IS R2(B).THEN WHAT VALUE IN PLACE OF X WILL MAKE A DEPENDENCY FROM T2 TO T1

THAT WILL BE W1(B)

IF U R CONFUSING WITH THE DESCRIPTION THE DRAW THE TRANSACTION...

edited by

Related questions

0 votes
0 votes
1 answer
3
LavTheRawkstar asked Feb 28, 2017
12,835 views
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}Given the capacity is 5,{W/M = 5 } Find the optimal solu...
0 votes
0 votes
1 answer
4
neha singh asked Mar 20, 2017
1,194 views
A)L(r1)⊆L(r2) and L(r3)⊆L(r2)b) L(r2)⊆L(r1) and L(r2)⊆L(r3)C) L(r1)=L(r3)⊆L(r2)D) L(r1)⋃L(r3)=L(r2)plz explain with explanation