1 votes 1 votes T1 T2 R(A) W(A) W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN Databases databases transaction-and-concurrency conflict-serializable + – gatecrack asked Dec 10, 2018 gatecrack 734 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Lakshman Bhaiya commented Dec 10, 2018 reply Follow Share make polly graph Not view serializable. 0 votes 0 votes chandler bing commented Dec 12, 2018 reply Follow Share Picture please. 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes In given transactionsn, we can make polly graph by using First Read and Last Write, then merge both of them. Lakshman Bhaiya answered Dec 12, 2018 • edited Jan 9, 2019 by Lakshman Bhaiya Lakshman Bhaiya comment Share Follow See all 2 Comments See all 2 2 Comments reply Lakshman Bhaiya commented Dec 12, 2018 i edited by Lakshman Bhaiya Dec 13, 2018 reply Follow Share @Mk Utkarsh please verify? I have the problem with Polly graph, can you explain in more detailed? 0 votes 0 votes Hemanth_13 commented Dec 17, 2018 reply Follow Share Yes this is not view serializable because there won't be any serial schedule possible with Transaction T1 performing the first read also performing the final write (with two transactions T1 and T2). 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes If T1 first read then it also first write to removing cycle from precedence graph but that not possible so given schedule not view Ram Swaroop answered Dec 14, 2018 Ram Swaroop comment Share Follow See 1 comment See all 1 1 comment reply Ram Swaroop commented Dec 14, 2018 reply Follow Share Not view 1 votes 1 votes Please log in or register to add a comment.
