2 votes 2 votes Consider the following schedule: S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B) How many serial schedules conflict equal to schedules (S)? Databases transaction-and-concurrency databases made-easy-test-series + – shivangi5 asked Dec 4, 2017 • edited Mar 7, 2019 by Aditi Singh shivangi5 1.9k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply vamp_vaibhav commented Dec 5, 2017 reply Follow Share Answer is 10??? 0 votes 0 votes shivangi5 commented Dec 5, 2017 reply Follow Share Elaborate it please 0 votes 0 votes vamp_vaibhav commented Dec 5, 2017 reply Follow Share Given the solution below check it.. 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes Check this solution.. Let me know if anything wrong or not understandable.. vamp_vaibhav answered Dec 5, 2017 • selected Dec 5, 2017 by shivangi5 vamp_vaibhav comment Share Follow See all 4 Comments See all 4 4 Comments reply sunaina rawat commented Dec 5, 2017 reply Follow Share @vamp_vaibhav how 5 places for T3 please explain 0 votes 0 votes vamp_vaibhav commented Dec 5, 2017 reply Follow Share Sunaina.. As you can see we have _T1_ T2 _T4_ T5_ _T1_T4_T2_T5_ on every blank space we can have T3 which leads to the total possible value =10 0 votes 0 votes sunaina rawat commented Dec 5, 2017 reply Follow Share @ vamp_vaibhav if no. of view serializable schedules would have asked than how to approach 0 votes 0 votes vamp_vaibhav commented Dec 6, 2017 reply Follow Share For number of view serializable you don't have any direct approach.. For accurate answer you need to check the schedule based on : final write, initial read and updated read in the sequence.. 1 votes 1 votes Please log in or register to add a comment.
