Consistency in Hierarchical Database Systems
From MaRDI portal
Cited in
(12)- Is distributed locking harder?
- Serializability theory for replicated databases
- Concurrent execution of transaction copies
- Shifting timestamps for concurrency control in an information hierarchy
- Concurrency and trie hashing
- Deleting completed transactions
- A characterization of database graphs admitting a simple locking protocol
- On-line multiversion database concurrency control
- Safe locking policies for dynamic databases
- A formal model of atomicity in asynchronous systems
- Advanced concurrency control in Java
- Deadlock-freedom (and safety) of transactions in a distributed database
This page was built for publication: Consistency in Hierarchical Database Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3867168)