TY - GEN
T1 - Two-stage transaction processing in client-server DBMSs
AU - Kanitkar, V.
AU - Delis, A.
N1 - Funding Information:
*This work was supported in part by the National Science Foundation under Grant NSF IIS-9733642 and the CATT Center.
Funding Information:
This work was supported in part by the National Science Foundation under Grant NSF IIS-9733642 and the CATT Center.
Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85049193744&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049193744&partnerID=8YFLogxK
U2 - 10.1109/HPDC.1998.709961
DO - 10.1109/HPDC.1998.709961
M3 - Conference contribution
AN - SCOPUS:85049193744
T3 - Proceedings - 7th International Symposium on High Performance Distributed Computing, HPDC 1998
SP - 1
EP - 8
BT - Proceedings - 7th International Symposium on High Performance Distributed Computing, HPDC 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th IEEE International Symposium on High Performance Distributed Computing, HPDC 1998
Y2 - 31 July 1998
ER -