Give an example of a schedule that would be accepted by a two-phase locking concurrency control but not by a timestamp-ordered concurrency control.
What will be an ideal response?
r1(x) r2(x) w2(y) commit2 w1(x) commit1
This schedule would be accepted by a two-phase locking concurrency control with T2
before T1 in the serial order. However it would not be accepted by a timestamp-ordered
concurrency control because, with such a control, T1 must be before T2 because it
started before T2, and thus T2 should have read the value of x that T1 wrote.
Computer Science & Information Technology
You might also like to view...
To ensure that information is entered, sorted, and displayed consistently, an input mask can be defined in a field
Indicate whether the statement is true or false
Computer Science & Information Technology
Explain strategic governance.
What will be an ideal response?
Computer Science & Information Technology