Using Optimistic Locking, both Transaction1 and Transaction 2 have read the same row including the RID_BIT and ROW CHANGE TOKEN values. Transaction 1 updates the row after ensuring that the row has not changed after the previous SELECT by adding a RID_BIT and ROW CHANGE TOKEN predicate to the UPDATE statement. Transaction 2 now tries to update that same row using the same predicate as transaction 1.
What will be the result?
A. The row will be found with the same ROW CHANGE TOKEN. Transaction 2 will now insert its values replacing those of transaction 1.
B. The row will be found with a different ROW CHANGE TOKEN and Transaction 2 will overwrite the values set in transaction 1.
C. The row will not be found because the value of the ROW CHANGE TOKEN has changed in regard to the UPDATE of transaction 1. Transaction 2 has to retry in order to retrieve the current data.
D. The row will not be found because the value of the ROW CHANGE TOKEN has changed in regard to the UPDATE of transaction 1. Transaction 2 will complete with an insert of a new row.