Extended Commitment Ordering or Guaranteeing Global Serializability by Applying Commitment Order Selectivity to Global Transactions.

@inproceedings{DBLP:conf/pods/Raz93,
  author    = {Yoav Raz},
  title     = {Extended Commitment Ordering or Guaranteeing Global Serializability
               by Applying Commitment Order Selectivity to Global Transactions},
  booktitle = {Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, May 25-28, 1993, Washington,
               DC},
  publisher = {ACM Press},
  year      = {1993},
  isbn      = {0-89791-593-3},
  pages     = {83-96},
  ee        = {http://doi.acm.org/10.1145/153850.153858, db/conf/pods/Raz93.html},
  crossref  = {DBLP:conf/pods/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

The Extended Commitment Ordering (ECO) property of transaction histories (schedules) generalizes the Commitment Ordering (CO) property defined in [Raz 90]. In a multi resource manager (RM) environment ECO guarantees global serializability when supported locally by each RM that participates in global transactions (i.e., transactions that span more than a single RM) and provides local serializability (by any mechanism). ECO assumes that a RM has the knowledge to distinguish local transactions (i.e., transactions confined to that RM) from global transactions. ECO imposes an order condition, similar to the CO condition, on the commit events of global transactions only, and thus, it is less constraining than CO.

Like CO, ECO provides a fully distributed solution to the long standing problem of guaranteeing global serializability across RMs with different concurrency control mechanisms. Also, like CO, no communication beyond atomic commitment (AC) protocol messages is required to enforce ECO.

When RMs are provided with the information about transactions being local, and are coordinated solely via AC protocols (have the extended knowledge autonomy property), ECO, applied locally together with local serializability in each RM involved with global transactions, is a necessary condition for guaranteeing global serializability.

ECO reduces to CO when all the transactions are assumed to be global (e.g. if no knowledge about the transactions being local is available).

Copyright © 1993 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.

• 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
• UNIX/LINUX/Mac: use mount point /pods8298/... 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
• UNIX/LINUX/Mac: use mount point /aDVD1/... or /cdrom/...

Printed Edition

Online Edition: ACM Digital Library

References

[Bern87]

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

[Brei91]

Yuri Breitbart, Dimitrios Georgakopoulos, Marek Rusinkiewicz, Abraham Silberschatz: On Rigorous Transaction Scheduling. IEEE Trans. Software Eng. 17(9): 954-960(1991) BibTeX

[Elma90]

Ahmed K. Elmagarmid, Weimin Du: A Paradigm for Concurrency Control in Heterogeneous Distributed Database Systems. ICDE 1990: 37-46 BibTeX

[Eswa76]

Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) BibTeX

[Even79]

...

[Garc88]

Hector Garcia-Molina, Boris Kogan: Node Autonomy in Distributed Systems. DPDS 1988: 158-166 BibTeX

[Geor91]

Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit P. Sheth: On Serializability of Multidatabase Transactions Through Forced Local Conflicts. ICDE 1991: 314-323 BibTeX

[Gilg85]

...

[Gary78]

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

[Hadz87]

Vassos Hadzilacos: A Knowledge Theoretic Analysis of Atomic Commitment Protocols. PODS 1987: 129-134 BibTeX

[Hadz88]

Vassos Hadzilacos: A theory of reliability in database systems. J. ACM 35(1): 121-145(1988) BibTeX

[Halp87]

...

[Kung81]

H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981) BibTeX

[Litw89]

...

[Papa86]

...

[Pu88]

...

[Raz90]

...

[Raz91a]

...

[Raz91b]

...

[Raz92]

Yoav Raz: The Principle of Commitment Ordering, or Guaranteeing Serializability in a Heterogeneous Environment of Multiple Autonomous Resource Mangers Using Atomic Commitment. VLDB 1992: 292-312 BibTeX

[Raz93]

Yoav Raz: Commitment Ordering Based Distributed Concurrency Control for Bridging Single and Multi Version Resources. RIDE-IMS 1993: 189-198 BibTeX

[Shet90]

Amit P. Sheth, James A. Larson: Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases. ACM Comput. Surv. 22(3): 183-236(1990) BibTeX

[Weih89]

William E. Weihl: Local Atomicity Properties: Modular Concurrency Control for Abstract Data Types. ACM Trans. Program. Lang. Syst. 11(2): 249-283(1989) BibTeX

Referenced by

1. Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit P. Sheth: Using Tickets to Enforce the Serializability of Multidatabase Transactions. IEEE Trans. Knowl. Data Eng. 6(1): 166-180(1994)
2. Yoav Raz: The Principle of Commitment Ordering, or Guaranteeing Serializability in a Heterogeneous Environment of Multiple Autonomous Resource Mangers Using Atomic Commitment. VLDB 1992: 292-312