Nested Transactions and Read/Write Locking.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1987
Accession Number
ADA191981

Entities

People

  • Alan Fekete
  • Michael Merritt
  • Nancy Lynch
  • William Weihl

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Engineered Resilient Systems
  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Automata
  • Classification
  • Communication Systems
  • Computer Programming
  • Computer Science
  • Computers
  • Contracts
  • Data Management
  • Databases
  • Information Processing
  • Massachusetts
  • Mathematics
  • Military Research
  • Recovery
  • Transparencies

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Database Systems and Applications