ACM Home Page
Please provide us with feedback. Feedback
Extended commitment ordering, or guaranteeing global serializability by applying commitment order selectively to global transactions
Full text PdfPdf (1.40 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Washington, D.C., United States
Pages: 83 - 96  
Year of Publication: 1993
ISBN:0-89791-593-3
Author
Yoav Raz  Digital Equipment Corp., Littleton, MA
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/153850.153858
What is a DOI?

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).


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.

 
Bern87
 
Brei 91
 
Elma90
Eswa 76
 
Even 79
 
Garc 88
 
Geor 91
 
Glig85
V. Gligor, R. Popescu-Zeletin, "Concurrency Control Issues in Distributed Heterogeneous Database Management Systems", in F. A. Schreiber, W. Litwin editors, Distributed Data Sharing Systems, pp. 43-56, North Holland, 1985.
 
Gray 78
Hadz87
Hadz 88
 
Halp87
Joseph Y. Halpem, "Using Reasoning about Knowledge to Analyze Distributed Systems", Research Report RJ 5522 (56421) 3/3/87, Computer Science, IBM Almaden Research Center, San Jose, California, 1987.
Kung 81
 
Litw 89
Litwin, W., H. Tirri, "Flexible Concurrency Control Using Value Date", in integration of Information Systems: Bridging Heterogeneous Databases, ed. A. Gupta, IEEE Press, 1989.
 
Papa 86
 
Pu 88
Calton Pu, "Transactions across Heterogeneous Databases: the Superdatabase Architecture", Technical Report No. CUCS-243-86 (revised June 1988), Department of Computer Science, Columbia University, New York, NY.
 
Raz 90
Yoav Raz, "The Principle of Commitment Ordering, or Guaranteeing Serializability in a Heterogeneous, Multi Resource Manager Environment", DEC-TR 841, Digital Equipment Corporation, November 1990; revised April 1992.
 
Raz 91a
Yoav Raz, "The Commitment Order Coordinator (COCO) of a Resource Manager, or Architecture for Distributed Commitment Ordering Based Concurrency Control", DEC-TR 843, Digital Equipment Corporation, December 1991, revised April 1992.
 
Raz91b
Yoav Raz, "Locking Based Strict Commitment Ordering, or How to improve Concurrency in Locking Based Resource Managers", DEC-TR 844, Digital Equipment Corporation, December 1991, revised April 1992.
 
Raz 92
 
Raz 93
Yoav Raz, "Commitment Ordering Based Concurrency Control for Bridging Single and Multi Version Resources", to appear in the Proc. of the (IEEE sponsored) Third International Workshop on Research Issues on Data Engineering: lnteroperability in Multidatabase Systems, Viena, Austria, April 1993. Available also as DEC-TR 853, Digital Equipment Corporation, July 1992, revised October 1992.
Shet 90
Weih 89



Peer to Peer - Readers of this Article have also read: