A theory of reliability in database systems
From MaRDI portal
Recommendations
Cited in
(19)- Serializability theory for replicated databases
- A proof technique for concurrency control and recovery algorithms for replicated databases
- Deleting completed transactions
- Transaction management in n-version programmed database systems
- Serializability by commitment ordering
- Static and dynamic aspects of goal-oriented concurrency control
- Last-use opacity: a strong safety property for transactional memory with prerelease support
- Non-interference and local correctness in transactional memory
- I-serializability: generalized correctness for transaction-based environments
- Resilient Concurrency Control in Distributed Database Systems
- Database Integrity Block Construct: Concepts and Design Issues
- scientific article; zbMATH DE number 3965472 (Why is no real title available?)
- scientific article; zbMATH DE number 3986679 (Why is no real title available?)
- scientific article; zbMATH DE number 4084989 (Why is no real title available?)
- scientific article; zbMATH DE number 4098709 (Why is no real title available?)
- scientific article; zbMATH DE number 1543039 (Why is no real title available?)
- Fault-tolerance and complexity (extended abstract)
- The impact of recovery on concurrency control
- Commutativity-based locking for nested transactions
This page was built for publication: A theory of reliability in database systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4711346)
