A theorem in database concurrency control

DOI10.1145/322344.322349MaRDI QIDQ3954812zbMATH OpenOpenAlexFDO

Authors Christos 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 systemsprocess managementtransaction processing

Mathematics Subject Classification ID

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

Cited in

(6)

• Is distributed locking harder?
• A cautious scheduler for multistep transactions
• 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)
• On the power of safe locking

This page was built for publication: A theorem in database concurrency control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3954812)