1 1 vote T1 T2 R(A) W(A) W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN Databases databases transaction-and-concurrency conflict-serializable + – gatecrack 1.5k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Lakshman Bhaiya commented Dec 10, 2018 reply Follow flag make polly graph Not view serializable. 0 0 replyShare chandler bing commented Dec 12, 2018 reply Follow flag Picture please. 0 0 replyShare Please log in or register to add a comment.
Best answer 1 1 vote 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 2 2 Comments reply Lakshman Bhaiya commented Dec 12, 2018 i edited by Lakshman Bhaiya Dec 13, 2018 reply Follow flag @Mk Utkarsh please verify? I have the problem with Polly graph, can you explain in more detailed? 0 0 replyShare Hemanth_13 commented Dec 17, 2018 reply Follow flag 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 1 replyShare Please log in or register to add a comment.
0 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 1 1 comment reply Ram Swaroop commented Dec 14, 2018 reply Follow flag Not view 1 1 replyShare Please log in or register to add a comment.
