By Topic

Commitment ordering based distributed concurrency control for bridging single and multi version resources

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

1 Author(s)
Y. Raz ; Digital Equipment Corp., Littleton, MA, USA

Multi version (MV) based database systems allow queries (read-only transactions) to be executed without blocking updaters (read-write transactions), or being blocked by them. Such systems become more and more common. In a multi database environment, transactions may span several single version (SV) based database systems, as well as MV based ones. The database systems may implement various concurrency control techniques. It is required that a globally correct concurrency control is guaranteed. Commitment ordering (CO) is a serializability concept, that allows global serializability to be effectively achieved across multiple autonomous resource managers (RMs; e.g. database systems). The RMs may use different (any) concurrency control mechanisms. Generic distributed CO algorithms, which guarantee the 1SER property over multiple RMs with mixed, SV and MV resources are presented. It is shown, that CO is a necessary condition for guaranteeing 1SER over multiple autonomous RMs with mixed resources

Published in:

Research Issues in Data Engineering, 1993: Interoperability in Multidatabase Systems, 1993. Proceedings RIDE-IMS '93., Third International Workshop on

Date of Conference:

19-20 Apr 1993