1 1 vote Consider a Serial Schedule given- T1 T2 T3 w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) How many schedules which are view equivalent to above schedule? How many schedules which are confilct equivalent to above schedule? Is this schedule conflict serializable/ view serializable? If yes How many serial schedules are possible which are conflict equivalent/ view equivalent to able schedule? Databases databases transaction-and-concurrency view-serializable conflict-serializable + – Durgesh Singh 1.4k views answer comment Share Follow Print See 1 comment 1 1 comment reply bharti commented Dec 23, 2017 reply Follow flag no of serial schedule = 1 no of conflict equivalent = 8 , no of view equivalent = 16 what is the answer ??? 0 0 replyShare Please log in or register to add a comment.
2 2 votes Answer to all asked questions is only one serial schedule which is T1-T2-T3.As the given schedule is already a serial one, now u can not move up/down any of the transaction due to conflict pairs. AakS answered Sep 30, 2017 AakS comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes number of view equivalant schedules = 12-1 => 11 and conflict equivalant = 8 small mistake = R3(A) CAN be placed at 4 different places instead of 3 so number of schedule will be 8 instead of 6 and discarding one schedule because it is already given in question anyone can suggest how to rotate the ? sachin486 answered Nov 28, 2020 • edited Dec 16, 2020 by sachin486 sachin486 comment Share Follow 0 reply Please log in or register to add a comment.
