Accession Number : ADA191981

Title :   Nested Transactions and Read/Write Locking.

Descriptive Note : Technical rept.,

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE

Personal Author(s) : Fekete, Alan ; Lynch, Nancy ; Merritt, Michael ; Weihl, William

PDF Url : ADA191981

Report Date : Apr 1987

Pagination or Media Count : 42

Abstract : We give a clear yet rigorous correctness proof for Moss's algorithm for managing data in a nested transaction system. The algorithm, which is the basis of concurrency control and recovery in the Argus system, uses read- and write-locks and a stack of versions of each object to ensure the serializability and recoverability of transactions accessing the data. Our proof extends earlier work on exclusive locking to prove that Moss's algorithm generates serially correct executions in the presence of concurrency and transaction aborts. The key contribution is the identification of a simple property of read operations, called transparency, that permits shared locks to be used for read operations. Keywords: Database management; Nested transactions, Atomic actions, Concurrency control, Recovery, Databases, Serializability, Readlocks, Write-locks.

Descriptors :   *DATA MANAGEMENT, *INPUT OUTPUT PROCESSING, ALGORITHMS, DATA BASES, SHARING, ACCESS, CONTROL, COMPUTER LOGIC

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE