Serializability theory for replicated databases

DOI10.1016/0022-0000(85)90058-3zbMath0604.68108OpenAlexW1966089826MaRDI QIDQ1083230

Philip A. Bernstein, Nathan Goodman

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90058-3

zbMATH Keywords

distributed databasecorrectness proofsreplicated data algorithms

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

A proof technique for concurrency control and recovery algorithms for replicated databases, On the design of replicated databases

Uses Software

• INGRES

Cites Work

• Unnamed Item
• Multiversion concurrency control—theory and algorithms
• The serializability of concurrent database updates
• Consistency in Hierarchical Database Systems
• Reaching Agreement in the Presence of Faults
• Transactions and consistency in distributed database systems
• The Byzantine generals strike again
• The notions of consistency and predicate locks in a database system
• Time, clocks, and the ordering of events in a distributed system
• Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
• Formal Aspects of Serializability in Database Concurrency Control