Reservable Transactions: An Approach for Reliable Multidatabase Transaction Management
Ahmed K. Elmagarmid, Jing Jin, J. G. Mullen, Jamshid Sharif-Askary · Purdue e-Pubs (Purdue University System) · 1992
Atomically committing global transactions in a multidatabase system is difficult beca.use of local system autonomy.Traditional tra.nsaction management methods, such as two phase commit (2PC), are often not possible, since many database systems do not support a (visible) prepare-to-commlt state.And, even where the local database systems of a multidatabase do provide such support, the potential blocking and long dela.ys of 2PC can severly degrade local execution autonomy.Transaction models that use compensation (such as Sagas), can avoid some of these problems, however these methods are only appropriate for certain cases.This paper presents reservable transactions, which contain a reservation phase that utilizes data semantics to ensure that a transaction can commit, without completely blocking the data.that the transaction accesses.The method presented can handle cases where compensation is not applicable.In addition, the reservation concept can be used to jncrease the cases where compensation is applicable.