0 0 votes Databases + – shefali1 571 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply sumit chakraborty commented Nov 29, 2017 reply Follow flag What is your doubt exactly ? In timestamp ordering scheme any transaction with conflicting read and write operations must be executed according to their timestamp. So is a transaction T1 has come earlier ( read lower timestamp ) reading or writing A then transaction T2 which comes after T2 ( read higher timestamp ) cannot read or write on same A. https://practice.geeksforgeeks.org/problems/how-does-timestamp-ordering-protocol-operates http://www.cs.virginia.edu/~son/662.pdffiles/662.to.pdf 0 0 replyShare srivivek95 commented Nov 30, 2017 reply Follow flag In the TO scheme for the write operation, if any of the younger transaction (than T) has either read (i.e. TS(T)<Read-TS(Q) ) or write (i.e.TS(T)<Write-TS(Q) ) the database item then write is rejected & T is rolled back. In the TO scheme for the read operation, if any of the younger transaction (than T) has write (i.e.TS(T)<Write-TS(Q) ) the database item then read is rejected & T is rolled back. 0 0 replyShare Please log in or register to add a comment.
