A proof technique for concurrency control and recovery algorithms for replicated databases

DOI10.1007/BF01786253zbMath0634.68012OpenAlexW2028781918MaRDI QIDQ1097027

Nathan Goodman, Philip A. Bernstein

Publication date: 1987

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01786253

zbMATH Keywords

distributed databaseconcurrency controlserializabilityfailure-recoveryreplicated databaseserialization graph

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Cites Work

• Serializability theory for replicated databases
• The serializability of concurrent database updates
• The notions of consistency and predicate locks in a database system
• Formal Aspects of Serializability in Database Concurrency Control

This page was built for publication: A proof technique for concurrency control and recovery algorithms for replicated databases