Concurrency Control by Locking

DOI10.1137/0212013zbMath0519.68086OpenAlexW2070860822MaRDI QIDQ3668892

Christos H. 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

zbMATH Keywords

safetydata baseconcurrency controltransactiontwo-phase lockinggeometry of locking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (7)

Partitioning and separating sets of orthogonal polygons ⋮ On the power of safe locking ⋮ Locking based on a pairwise decomposition of the transaction system ⋮ Deadlock-freedom (and safety) of transactions in a distributed database ⋮ 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) ⋮ Is distributed locking harder?

This page was built for publication: Concurrency Control by Locking