A theorem in database concurrency control

DOI10.1145/322344.322349zbMath0492.68029OpenAlexW2085006987MaRDI QIDQ3954812

Christos H. Papadimitriou

Publication date: 1982

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322344.322349

zbMATH Keywords

lockingoperating systemstransaction processingprocess management

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (6)

A cautious scheduler for multistep transactions ⋮ On the power of safe locking ⋮ Locking based on a pairwise decomposition of the transaction system ⋮ 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: A theorem in database concurrency control