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 unified theory of concurrency control and recovery has been introduced that is based on commutativity 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 unified protocols that guarantee atomicity and serializability.
|Number of pages||15|
|Publication status||Published - 1 Jan 1994|
ASJC Scopus subject areas
- Information Systems
- Hardware and Architecture
- Management of Technology and Innovation
- Management Information Systems