Concurrency Control by Locking
From MaRDI portal
Publication:3668892
Cited in
(7)- Locking based on a pairwise decomposition of the transaction system
- Deadlock-freedom (and safety) of transactions in a distributed database
- On the power of safe locking
- Partitioning and separating sets of orthogonal polygons
- Is distributed locking harder?
- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
- Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access)
This page was built for publication: Concurrency Control by Locking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668892)