Concurrency Control by Locking
From MaRDI portal
Publication:3668892
DOI10.1137/0212013zbMATH Open0519.68086OpenAlexW2070860822MaRDI QIDQ3668892FDOQ3668892
Authors: Christos Papadimitriou
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212013
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)
Cited In (7)
- Deadlock-freedom (and safety) of transactions in a distributed database
- Is distributed locking harder?
- Partitioning and separating sets of orthogonal polygons
- On the power of safe locking
- 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)
- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
- Locking based on a pairwise decomposition of the transaction system
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)