A Transaction Model for Multidatabase Systems

In this paper, we present a new transaction model for multidatabase systems (MDBSs). This model captures the formalism and semantics of various extended transaction models and adopts them to an MDBS environment. The extended models constituting our transaction model are the nested transactions [4], the flexible transaction model that provides various dependency relations among transactions [7], and the model that involves a relaxed version of transaction atomicity, namely the semantic atomicity, to increase the level of concurrency [2], [5]. While including the semantics of all those transaction models, the global serializability in our execution model was ensured through the use of the ticketing method [3].

[1]  Andrzej Cichocki,et al.  Towards a Model for Multidatabase Transactions , 1992, Int. J. Cooperative Inf. Syst..

[2]  E. B. Moss,et al.  Nested Transactions: An Approach to Reliable Distributed Computing , 1985 .

[3]  Ahmed K. Elmagarmid,et al.  A Multidatabase Transaction Model for InterBase , 1990, VLDB.

[4]  Amit P. Sheth,et al.  Using Tickets to Enforce the Serializability of Multidatabase Transactions , 1994, IEEE Trans. Knowl. Data Eng..

[5]  Rajeev Rastogi,et al.  A transaction model for multidatabase systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[6]  Bharat K. Bhargava,et al.  Ensuring relaxed atomicity for flexible transactions in multidatabase systems , 1994, SIGMOD '94.