ACM Home Page
Please provide us with feedback. Feedback
Efficient commit protocols for the tree of processes model of distributed transactions
Full text PdfPdf (802 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the second annual ACM symposium on Principles of distributed computing table of contents
Montreal, Quebec, Canada
Pages: 76 - 88  
Year of Publication: 1983
ISBN:0-89791-110-5
Authors
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800221.806711
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Borr, A. "Transaction Monitoring in ENCOMPASS: Reliable Distributed Transaction Processing", Proc. International Conference on Very Large Data Bases, September 1981.
2
 
3
Daniels, D., Selinger, P., Haas, L., Lindsay, B., Mohan, C., Walker, A., Wilms, P. "An Introduction to Distributed Query Compilation in R*", Proc. Second International Symposium on Distributed Data Bases, Berlin, September 1982. Also IBM Research Report RJ3497.
4
 
5
 
6
Gray, J. "The Transaction Concept: Virtues and Limitations", Proc. Seventh Int. Conf. on Very Large Data Bases, October 1981.
 
7
Harder, T., Reuter, A. "Principles of Transaction Oriented Database Recovery - A Taxonomy", Technical Report 50/82, University of Kaiserslautern, W. Germany, April 1982.
8
 
9
Haas, L.M., Selinger, P.G., Bertino, E., Daniels, D., Lindsay, B., Lohman, G., Masunaga, Y., Mohan, C., Ng, P., Wilms, P., Yost, R. "R*: A Research Project on Distributed Relational DBMS", Database Engineering, Volume 5, Number 2, December 1982. Also IBM Research Report RJ3653, October 1982.
 
10
11
 
12
Lindsay, B., Selinger, P., Galtieri, C., Gray, J., Lorie, R., Putzolu, F., Traiger, I., Wade, B. "Single and Multi-Site Recovery Facilities", In Distributed Data Bases, Edited by I.W. Draffan and F. Poole, Cambridge University Press, 1980. Also Available as "Notes on Distributed Databases", IBM Research Report RJ2571, San Jose, July 1979.
13
14
15
 
16
Skeen, D. "A Quorum-Based Commit Protocol", Proc. 6th Berkeley Workshop on Distributed Data Management and Computer Networks, May 1982, pp. 69-90.
 
17
Stonebraker, M. "Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES", IEEE Transactions on Software Engineering, Vol. 5, No. 3, May 1979.

CITED BY  21