Commutativity-based locking for nested transactions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3986679 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- A model for concurrency in nested transactions systems
- A theory of reliability in database systems
- Commutativity-based concurrency control for abstract data types
- Concurrency of operations on B-trees
- Locking Primitives in a Database System
- Multiversion concurrency control—theory and algorithms
- Necessary and sufficient conditions for R-graph synthesis
- On Concurrency Control by Multiple Versions
- Serializability by Locking
- The impact of recovery on concurrency control
- The notions of consistency and predicate locks in a database system
- The serializability of concurrent database updates
Cited in
(14)- Transactional Lock Elision Meets Combining
- scientific article; zbMATH DE number 604429 (Why is no real title available?)
- Hybrid atomicity for nested transactions
- scientific article; zbMATH DE number 2080466 (Why is no real title available?)
- Security correctness for secure nested transactions (extended abstract)
- A model for concurrency in nested transactions systems
- Transaction synchronisation in object bases
- Multi-granularity locking for nested transactions: A proof using a possibilities mapping
- Virtual partition algorithm in a nested transaction environment and its correctness
- Commutativity-based concurrency control for abstract data types
- Hybrid concurrency control for abstract data types
- A reliable nested transaction model with extension of real-time characteristics
- Compatibility and commutativity of lock modes
- Introduction to the theory of nested transactions
This page was built for publication: Commutativity-based locking for nested transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753480)
