A note on the transaction backout problem

DOI10.1016/0020-0190(87)90177-3zbMATH Open0653.68006OpenAlexW2057353022MaRDI QIDQ1107967FDOQ1107967

Authors: Mark W. Krentel 

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6577

Recommendations

• Deadlock-freedom (and safety) of transactions in a distributed database
• scientific article; zbMATH DE number 3876651
• Is distributed locking harder?
• scientific article; zbMATH DE number 4033153
• The Complexity of Distributed Concurrency Control

zbMATH Keywords

dynamic programmingfault-toleranceNP-completedistributed databasestransaction backout

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• On the complexity of inverse mixed integer linear optimization

This page was built for publication: A note on the transaction backout problem

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