Robustness against Read Committed for Transaction Templates with Functional Constraints

DOI10.46298/lmcs-19(4:39)2023arXiv2201.05021OpenAlexW4390192925MaRDI QIDQ6137875

Bas Ketsman, Frank Neven, Brecht Vandevoort, Christoph Koch

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.05021

zbMATH Keywords

complexityrobustnessconcurrency control

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• Analysing Snapshot Isolation
• Robustness against Consistency Models with Atomic Visibility
• A Framework for Transactional Consistency Models with Atomic Visibility
• A variant of a recursively unsolvable problem
• Robustness Against Transactional Causal Consistency.