Commitment in a Partitioned Distributed Database.

@inproceedings{DBLP:conf/sigmod/Ramarao88,
  author    = {K. V. S. Ramarao},
  editor    = {Haran Boral and
               Per-{\AA}ke Larson},
  title     = {Commitment in a Partitioned Distributed Database},
  booktitle = {Proceedings of the 1988 ACM SIGMOD International Conference on
               Management of Data, Chicago, Illinois, June 1-3, 1988},
  publisher = {ACM Press},
  year      = {1988},
  pages     = {371-378},
  ee        = {http://doi.acm.org/10.1145/50202.50247, db/conf/sigmod/Ramarao88.html},
  crossref  = {DBLP:conf/sigmod/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Abstract Network partition is among the hardest failure types in a distributed system even if all processors and links are of fail-stop type. We address the transaction commitment problem in a partitioned distributed database. It is assumed that partitions are detectable. The approach taken is conservative - that is, the same transaction cannot be committed by one site and aborted by another.

A new and very general formal model of protocols operating in a partitioned system is introduced and protocols more efficient than the existing ones are constructed.

Copyright © 1988 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/smod7592 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

Online Edition: ACM Digital Library

References

[1]

Daniel Barbará, Hector Garcia-Molina: Mutual Exclusion in Partitioned Distributed Systems. Distributed Computing 1(2): 119-132(1986) BibTeX

[2]

Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX

[3]

Francis Y. L. Chin, K. V. S. Ramarao: Optimal Termination Protocols for Network Partitioning. SIAM J. Comput. 15(1): 131-144(1986) BibTeX

[4]

Francis Y. L. Chin, K. V. S. Ramarao: An Information-Based Model for Failure-Handling in Distributed Database Systems. IEEE Trans. Software Eng. 13(4): 420-431(1987) BibTeX

[5]

Eric C. Cooper: Analysis of Distributed Commit Protocols. SIGMOD Conference 1982: 175-183 BibTeX

[6]

Susan B. Davidson: Optimism and Consistency In Partitioned Distributed Database Systems. ACM Trans. Database Syst. 9(3): 456-481(1984) BibTeX

[7]

Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985) BibTeX

[8]

Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer: On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97(1987) BibTeX

[9]

Cynthia Dwork, Dale Skeen: The Inherent Cost of Nonblocking Commitment. PODC 1983: 1-11 BibTeX

[10]

Amr El Abbadi, Sam Toueg: Availability in Partitioned Replicated Databases. PODS 1986: 240-251 BibTeX

[11]

Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382(1985) BibTeX

[12]

...

[13]

Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 BibTeX

[14]

Maurice Herlihy: A Quorum-Consensus Replication Method for Abstract Data Types. ACM Trans. Comput. Syst. 4(1): 32-53(1986) BibTeX

[15]

...

[16]

C. Mohan, Bruce G. Lindsay: Efficient Commit Protocols for the Tree of Processes Model of Distributed Transactions. PODC 1983: 76-88 BibTeX

[17]

Douglas Stott Parker Jr., Gerald J. Popek, Gerard Rudisin, Allen Stoughton, Bruce J. Walker, Evelyn Walton, Johanna M. Chow, David A. Edwards, Stephen Kiser, Charles S. Kline: Detection of Mutual Inconsistency in Distributed Systems. IEEE Trans. Software Eng. 9(3): 240-247(1983) BibTeX

[18]

K. V. S. Ramarao: Detection of Mutual Inconsistency in Distributed Databases. ICDE 1987: 405-411 BibTeX

[19]

K. V. S. Ramarao: Transaction Atomicity in the Presence of Network Partitions. ICDE 1988: 512-519 BibTeX

[20]

Sunil K. Sarin, Barbara T. Blaustein, Charles W. Kaufman: System Architecture for Partition-Tolerant Distributed Databases. IEEE Trans. Computers 34(12): 1158-1163(1985) BibTeX

[21]

Dale Skeen: Nonblocking Commit Protocols. SIGMOD Conference 1981: 133-142 BibTeX

[22]

Dale Skeen: A Quorum-Based Commit Protocol. Berkeley Workshop 1982: 69-80 BibTeX

[23]

Dale Skeen, Michael Stonebraker: A Formal Model of Crash Recovery in a Distributed System. IEEE Trans. Software Eng. 9(3): 219-228(1983) BibTeX

Referenced by

1. Leszek Lilien: Quasi-Partitioning: A New Paradigm for Transaction Execution in Partitioned Distributed Database Systems. ICDE 1989: 546-553