Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Analysis of distributed commit protocols
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Distributed Systems - Architecture and Implementation, An Advanced Course
Computation & communication in R: a distributed database manager
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
File servers for network-based distributed systems
ACM Computing Surveys (CSUR)
Optimistic recovery in distributed systems
ACM Transactions on Computer Systems (TOCS)
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Commitment in a partitioned distributed database
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Analysis of transaction management performance
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Experience with transactions in QuickSilver
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Coordinated resource recovery in VM/ESA
IBM Systems Journal
ACM Transactions on Database Systems (TODS)
Evaluation of remote backup algorithms for transaction processing systems
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Open commit protocols tolerating commission failures
ACM Transactions on Database Systems (TODS)
Evaluation of remote backup algorithms for transaction-processing systems
ACM Transactions on Database Systems (TODS)
IBM Systems Journal
Atomicity with incompatible presumptions
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
REQUEST II — a distributed database system for local area networks
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Dealing with incompatible presumptions of commit protocols in multidatabase systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Computation and communication in R*: a distributed database manager
ACM Transactions on Computer Systems (TOCS)
Cluster Computing
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A New Presumed Commit Optimization for Two Phase Commit
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Patterns of communication in consensus protocols
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
ACM SIGOPS Operating Systems Review
Dynamic support to transactional remote invocations over multiple transports
Proceedings of the 2008 ACM symposium on Applied computing
Logging last resource optimization for distributed transactions in Oracle WebLogic server
Proceedings of the 13th International Conference on Extending Database Technology
Using the compliant systems architecture to deliver flexible policies within two-phase commit
BNCOD'03 Proceedings of the 20th British national conference on Databases
| Hi-index | 0.00 |
This paper describes two efficient distributed transaction commit protocols, the Presumed Abort (PA) and Presumed Commit (PC) protocols, which have been implemented in the distributed data base system R* [DSHLM82, LHMWY83]. PA and PC are extensions of the well-known two-phase (2P) commit protocol [Gray78, Lamp80, LSGGL80]. PA is optimized for read-only transactions and a class of multi-site update transactions, and PC is optimized for other classes of multi-site update transactions. The optimizations result in reduced inter-site message traffic and log writes, and, consequently, a better response time for such transactions. We derive the new protocols in a step-wise fashion by modifying the 2P protocol.