By Topic

Exploiting transaction semantics in multidatabase systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. Rastogi ; AT&T Bell Labs., Murray Hill, NJ, USA ; H. F. Korth ; A. Silberschatz

Serializability is the traditionally accepted notion of correctness in most database systems. However, in a multidatabase system (MDBS) environment, where a number of pre-existing and autonomous database systems are integrated, requiring serializability could adversely affect the performance of the system. To enhance performance, one of the options is to relax the serializability requirement, and permit certain non-serializable executions. In this paper, we propose a powerful, yet simple mechanism, for specifying the set of non-serializable executions that are unacceptable in an MDBS environment. The undesirable interleavings among transactions are specified using regular expressions over transaction types. The mechanism facilitates the development of efficient graph-based schemes for ensuring that the concurrent execution of transactions meet the specifications. We analyze the complexities of the developed schemes and show that they are easily implementable in an MDBS environment

Published in:

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date of Conference:

30 May-2 Jun 1995