0 votes 0 votes Consider the following schedule : S:r1(A);w1(B);r2(A);w2(B);r3(A);w3(B); Here ri(X) denotes read on data item X and wi(X) denoted write on data item X .The total number of schedules that are view equivalent to S are _______ Databases made-easy-test-series databases transaction-and-concurrency + – Bharat patra asked Nov 25, 2018 edited Mar 4, 2019 by akash.dinkar12 Bharat patra 1.9k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply kumar.dilip commented Nov 25, 2018 reply Follow Share See here https://gateoverflow.in/137024/dbms-number-of-view-equal-schedules Let me know if you are not getting. 0 votes 0 votes Bharat patra commented Nov 25, 2018 reply Follow Share There is bit confusion between view equivalent and view equivalent to a serial schedule? Also according to ME answer, they have taken two schedules possible T1->T2->T3 T2->T1->T3 (how is this possible where is the initial read condition then it is only satisfying the final write) Can you show me the solution how you have approached? Thanks! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes May be this works : kunal goswami answered Dec 26, 2019 kunal goswami comment Share Follow See all 0 reply Please log in or register to add a comment.