2 2 votes Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______. Databases databases transaction-and-concurrency + – vnc 2.2k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply yankur9 commented Jan 10, 2017 reply Follow flag 0 ?? 1 1 replyShare vnc commented Jan 10, 2017 reply Follow flag answer is 1 1 1 replyShare vijaycs commented Jan 27, 2017 reply Follow flag 0 shoul be ans ... as here every transaction is reading / writting data only once ..so any serilizable schedule would be conflict serilizable .. hence ans =0 ?? 1 1 replyShare Please log in or register to add a comment.
3 3 votes Please check the solution: Draw the precedence graph: 1 -- 2 -- 3--4--5--6 comes out to be order of dependency. So, only one conflict equivalent schedule possible. Total schedules possible with 6 transactions = 6! So 6! -1 are not conflict equivalent with given graph. agoh answered Jan 10, 2017 agoh comment Share Follow See all 6 Comments 6 6 Comments reply Show 3 previous comments Ravi Kaushik commented Jan 27, 2017 reply Follow flag We can as 2 and 3 is dependent of 4, 4 must execute before them, isn't it? 0 0 replyShare Chetnawadhwa commented Jan 27, 2017 reply Follow flag Acc to me...t2 and t3 are dependent o t4... 0 0 replyShare Akriti sood commented Mar 8, 2017 reply Follow flag there are more than one schedule which are conflcit equivalent. r1(a) w2(a) r2(a) w6(a) w4(a) r5(a) and r1(a) w6(a) w2(a) r2(a) w4(a) r5(a) they both will produce the same result as above given schedule,and do not form any cycle. 1 1 replyShare Please log in or register to add a comment.
1 1 vote ans is 1 2018 answered Mar 8, 2017 2018 comment Share Follow See 1 comment 1 1 comment reply Ravi Kaushik commented Mar 15, 2017 reply Follow flag How u have found these two view equivalent schedules? 1 1 replyShare Please log in or register to add a comment.
