Give an example of a schedule produced by a read-only multiversion concurrency control in which the read/write transactions serialize in commit order while the read-only transactions serialize in a different order.
What will be an ideal response?
r1(x) w2(y) w3(z ) commit3 commit2 r1(y) commit1
T1 does not see the newvalue of y written by T2 and hence serializes before T2 even
though it commits later.
Computer Science & Information Technology