article

Free access

Revisiting commit processing in distributed database systems

Authors:

Jayant Haritsa,

Krithi RamamrithamAuthors Info & Claims

ACM SIGMOD Record, Volume 26, Issue 2

Pages 486 - 497

https://doi.org/10.1145/253262.253366

Published: 01 June 1997 Publication History

Abstract

A significant body of literature is available on distributed transaction commit protocols. Surprisingly, however, the relative merits of these protocols have not been studied with respect to their quantitative impact on transaction processing performance. In this paper, using a detailed simulation model of a distributed database system, we profile the transaction throughput performance of a representative set of commit protocols. A new commit protocol, OPT, that allows transactions to “optimistically” borrow uncommitted data in a controlled manner is also proposed and evaluated. The new protocol is easy to implement and incorporate in current systems, and can coexist with most other optimizations proposed earlier. For example, OPT can be combined with current industry standard protocols such as Presumed Commit and Presumed Abort.

The experimental results show that distributed commit processing can have considerably more influence than distributed data processing on the throughput performance and that the choice of commit protocol clearly affects the magnitude of this influence. Among the protocols evaluated, the new optimistic commit protocol provides the best transaction throughput performance for a variety of workloads and system configurations. In fact, OPT's peak throughput is often close to the upper bound on achievable performance. Even more interestingly, a three-phase (i.e., non-blocking) version of OPT provides better peak throughput performance than all of the standard two-phase (i.e., blocking protocols evaluated in our study.

References

[1]

Y. Al-Houmaily and P. Chrysanthis, "Two-Phase Commit i~ Gigabit-Networked Distributed Databases", Proc. of 8th Intl. Conf. on Parallel and Distributed Computing Systems, Septe}~ber 1995.

[2]

!~. Agrawal, M. Carey and M. Livny, "Concurrency Control Performance Modeling: Alternatives and Implications", ACM Trans. on Database Systems, 12(4), 1987.

Digital Library

[3]

S. Banerjee and P. Chrysanthis, "A Fast and Robust Fail- ~lre R.ecovery Scheme for Shared-Nothing Gigabit-Networked Databases". Proc. of 9th Intl. Conf. on Parallel and Dist.t.7:hul~tt (:omput.i~9 Systems, September 1996.

[4]

B. Bt~argava. (editor), Concurrency and Reliability in Dist.mbut.e;d I)at.ahase Syst.ems, Van Nostrand Reinhold, 1987.

Digital Library

[5]

t' Berll.s't.eill, V. Hadzilacos and N. Goodman, Concurrency C~mt.rot and Recovery in Database Systems, Addison-Wesley, 1987.

Digital Library

[6]

M. Carey, S. Krishnamurthi and M. Livny, "Load Control for Locking: The 'Half-and-Half' Approach", Proc. of 9th Syrnp. on Principles of Database Systems, April 1990.

Digital Library

[7]

M. Carey and M. Livny, "Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication", Proc. of 14th intl. Conf. on Very Large Data Bases, August 1988.

Digital Library

[8]

M. Carey and M. Livny, "Parallelism and Concurrency Control Performance in Distributed Database Machines", Proc. of A CM SIGMOD Cony., June 1989.

Digital Library

[9]

M. Carey and M. Livny, "Conflict Detection Tradeoffs for Replicated Data", A CM Trans. on Database Systems, 16(4), 1991.

Digital Library

[10]

K. Eswaran et al, "The Notions of Consistency and Predicate Locks in a Database Systems", Comm. of ACM, 19(11), 1976.

Digital Library

[11]

R. Gupta, J. Haritsa and K. Ramamritham, "Revisiting Commit Processing in Distributed Database Systems", TR- 97-01, DSL/SERC, Indian Institute of Science, 1997.

[12]

R. Gupta, J. Haritsa, K. Ramamritham and S. Seshadri, "Commit Processing in Distributed Real-Time Database Systems", Proc. of 17th IEEE Real-Time Systems Symposium, December 1996.

Digital Library

[13]

J. Gray, "Notes on Database Operating Systems", Operating Systems: An Advanced Course, Lecture Notes in Computer Science, 60, 1978

Digital Library

[14]

M. Liu, D. Agrawal and A. E1 Abbadi, "The Performance of Two-Phase Commit Protocols in the Presence of Site Failures", Proc. of 24th Intl. Syrup. on Fault-Tolerant Computing, June 1994.

[15]

B. Lindsay et al, "Computation and Communication in R*: A Distributed Database Manager", A CM Trans. on Computer Systems, 2(1), 1984.

Digital Library

[16]

B. Lampson and D. Lomet, "A New Presumed Commit Optimization for Two Phase Commit", Proc. of 19th Intl. Conf. on Very Large Data Bases, August 1993.

Digital Library

[17]

B. Lampson and H. Sturgis, "Crash Recovery in a Distributed Data Storage System", Tech. Report, Xerox Palo Alto Research Center, 1976.

[18]

C. Mohan and D. Dievendorff, "Recent Work on Distributed Commit Protocols, and Recoverable Messaging and Queuing" Data Engineering Bulletin, 17(1), 1994.

[19]

C. Mohan, B. Lindsay and R. Obermarck, "Transaction Management in the R* Distributed Database Management System", A CM Tt'ans. on Database Systems, 11(4), 1986.

Digital Library

[20]

M. Ozsu and P. Valduriez, Principles of Distributed Database Systems, Prentice-Hail, 1991.

Digital Library

[21]

G. Samaras, K. Britton, A. Citron and C. Mohan, "Two-Phase Commit Optimizations in a Commercial Distributed Environment", Journal of Distributed and Parallel Databases, 3(4), 1995 (also in Proc. of 9th IEEE Intl. Conf. on Data Engineering, April 1993).

Digital Library

[22]

J. Stamos and F. Cristian, "A Low-Cost Atomic Commit Protocol", Proc. of 9th Syrup. on Reliable Distributed Systems, October 1990.

[23]

J. Stamos and F. Cristian, "Coordinator Log Transaction Execution Protocol", Journal of Distributed and Parallel Databases, 1 (4), 1993.

Digital Library

[24]

P. Spiro, A. Joshi and T. Rengarajan, "Designing an Optimized Transaction Commit Protocol", Digital Technical Journal, 3(1), 1991.

[25]

D. Skeen, "Nonblocking Commit Protocols", Proc. of A CM SIGMOD Conf., June 1981.

Digital Library

[26]

M. Stonebraker, "Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES", IEEE 7~ns. on Software Eng9., 5(3), 1979.

Cited By

Zhang ZHu HZhou XTu YQian WZhou A(2024)Fast Commitment for Geo-Distributed Transactions via Decentralized Co-CoordinatorsProceedings of the VLDB Endowment10.14778/3675034.367504617:10(2555-2567)Online publication date: 6-Aug-2024
https://doi.org/10.14778/3675034.3675046
Pandey SShanker U(2021)EDRCEncyclopedia of Information Science and Technology, Fifth Edition10.4018/978-1-7998-3479-3.ch055(800-814)Online publication date: 2021
https://doi.org/10.4018/978-1-7998-3479-3.ch055
Pandey SShanker U(2020)Causes, Effects, and Consequences of Priority Inversion in Transaction ProcessingHandling Priority Inversion in Time-Constrained Distributed Databases10.4018/978-1-7998-2491-6.ch001(1-13)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-2491-6.ch001
Show More Cited By

Index Terms

Revisiting commit processing in distributed database systems
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Networks
  1. Network protocols

Recommendations

Revisiting commit processing in distributed database systems
SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data

A significant body of literature is available on distributed transaction commit protocols. Surprisingly, however, the relative merits of these protocols have not been studied with respect to their quantitative impact on transaction processing ...
Commit processing in distributed database systems and in heterogeneous multidatabase systems
Commit processing in distributed real-time database systems
RTSS '96: Proceedings of the 17th IEEE Real-Time Systems Symposium

We investigate the performance implications of supporting transaction atomicity in a distributed real-time database system. Using a detailed simulation model of a firm-deadline distributed real-time database system, we profile the real-time performance ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 26, Issue 2

June 1997

583 pages

ISSN:0163-5808

DOI:10.1145/253262

Chairman:
Sudha Ram
Univ. of Arizona, Tucson
,
Editor:
Joan M. Peckham
Univ. of Rhode Island, Kingston

Issue’s Table of Contents

SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data
June 1997
594 pages
ISBN:0897919114
DOI:10.1145/253260
Editors:
Joan M. Peckman
Univ. of Rhode Island, Kingston
,
Sudha Ram
Univ. of Arizona, Tucson
,
Michael Franklin

Copyright © 1997 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1997

Published in SIGMOD Volume 26, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
990
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)12

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang ZHu HZhou XTu YQian WZhou A(2024)Fast Commitment for Geo-Distributed Transactions via Decentralized Co-CoordinatorsProceedings of the VLDB Endowment10.14778/3675034.367504617:10(2555-2567)Online publication date: 6-Aug-2024
https://doi.org/10.14778/3675034.3675046
Pandey SShanker U(2021)EDRCEncyclopedia of Information Science and Technology, Fifth Edition10.4018/978-1-7998-3479-3.ch055(800-814)Online publication date: 2021
https://doi.org/10.4018/978-1-7998-3479-3.ch055
Pandey SShanker U(2020)Causes, Effects, and Consequences of Priority Inversion in Transaction ProcessingHandling Priority Inversion in Time-Constrained Distributed Databases10.4018/978-1-7998-2491-6.ch001(1-13)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-2491-6.ch001
Pandey SShanker U(2020)Transaction scheduling protocols for controlling priority inversion: A reviewComputer Science Review10.1016/j.cosrev.2019.10021535(100215)Online publication date: Feb-2020
https://doi.org/10.1016/j.cosrev.2019.100215
Faleiro JAbadi DHellerstein J(2017)High performance transactions via early write visibilityProceedings of the VLDB Endowment10.14778/3055540.305555310:5(613-624)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.14778/3055540.3055553
Kolltveit HHvasshovd S(2008)Efficient High Availability Commit ProcessingProceedings of the 2008 Third International Conference on Availability, Reliability and Security10.1109/ARES.2008.78(64-71)Online publication date: 4-Mar-2008
https://dl.acm.org/doi/10.1109/ARES.2008.78
Abdouli MSadeg BAmanton L(2005)Scheduling Distributed Real-Time Nested TransactionsProceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing10.1109/ISORC.2005.49(208-215)Online publication date: 18-May-2005
https://dl.acm.org/doi/10.1109/ISORC.2005.49
Al-Houmaily Y(2005)On interoperating incompatible atomic commit protocols in distributed databases2005 1st International Conference on Computers, Communications, & Signal Processing with Special Track on Biomedical Engineering10.1109/CCSP.2005.4977178(149-156)Online publication date: Nov-2005
https://doi.org/10.1109/CCSP.2005.4977178
Younas MEaglestone BChao K(2004)A low-latency resilient protocol for e-business transactionsInternational Journal of Web Engineering and Technology10.1504/IJWET.2004.0052341:3(278-296)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1504/IJWET.2004.005234
Howard DDetmold HFalkner KMunro D(2003)Using the compliant systems architecture to deliver flexible policies within two-phase commitProceedings of the 20th British national conference on Databases10.5555/1758908.1758932(245-252)Online publication date: 15-Jul-2003
https://dl.acm.org/doi/10.5555/1758908.1758932
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents