A Proclamation-Based Model for Cooperating Transactions
24 February 1992
We propose a transaction model in which transactions are allowed to cooperate. We do so without sacrificing serializability. The model imposes some additional requirements on transactions as compared with the traditional model. When transactions wish to cooperate, they do so by issuing proclamations. A proclamation is an (implicitly or explicitly specified) set of values, one of which the transaction "promises" to write if it commits.