By Topic

Two-stage transaction processing in client-server DBMSs

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
$31 $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

2 Author(s)
Kanitkar, V. ; Dept. of Comput. & Inf. Sci., Polytech. Univ., Brooklyn, NY, USA ; Delis, A.

Shows that there is scope for replication in data-shipping client-server DBMSs, offering opportunities for improved transaction response times. To support this replication, we describe a two-stage protocol for transaction processing (2STP). We extend the conventional client-server data-shipping mechanism by allowing clients to update and query cached objects that have replicas in multiple sites. We use the concept of acceptance criteria to provide a means for the flexible handling of client updates. The effectiveness of the two-stage transaction processing mechanism is supported by means of queuing analysis and detailed simulation experiments comparing 2STP with a global lock-based data-shipping protocol. This improvement in transaction processing efficiency is achieved at the cost of longer downtimes for crash recovery

Published in:

High Performance Distributed Computing, 1998. Proceedings. The Seventh International Symposium on

Date of Conference:

28-31 Jul 1998