Unifying concurrency control and recovery of transactions

Transaction management in shared databases is generally viewed as a combination of two problems, concurrency control and recovery, which have been considered as orthogonal problems. Consequently, the correctness criteria derived for these problems are incomparable. Recently a uniied theory of concurrency control and recovery has been introduced that is based on com-mutativity and performs transaction recovery by submitting inverse operations for operations of aborted transactions. In this paper we provide a constructive correctness criterion that leads to the design of uniied protocols that guarantee atomicity and serializability.