Revisiting commit processing in distributed database systems Export

@inproceedings{revisiting-commit-processing, 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.}, address = {New York, NY, USA}, author = {Gupta, Ramesh and Haritsa, Jayant and Ramamritham, Krithi}, booktitle = {SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data}, citeulike-article-id = {5859499}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=253366}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/253260.253366}, doi = {10.1145/253260.253366}, isbn = {0-89791-911-4}, keywords = {databases, distributed-databases, hstorecc, two-phase-commit}, location = {Tucson, Arizona, United States}, pages = {486--497}, posted-at = {2009-09-30 13:18:53}, priority = {0}, publisher = {ACM}, title = {Revisiting commit processing in distributed database systems}, url = {http://dx.doi.org/10.1145/253260.253366}, year = {1997} }

TY - CONF ID - revisiting-commit-processing L3 - citeulike-article-id:5859499 N2 - 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. CY - Tucson, Arizona, United States SN - 0-89791-911-4 AD - New York, NY, USA EP - 497 TI - Revisiting commit processing in distributed database systems PB - ACM T2 - SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data SP - 486 KW - databases KW - distributed-databases KW - hstorecc KW - two-phase-commit AU - Gupta, Ramesh AU - Haritsa, Jayant AU - Ramamritham, Krithi PY - 1997/// UR - http://dx.doi.org/10.1145/253260.253366 ER -