The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A theory of reliability in database systems
Journal of the ACM (JACM)
Node autonomy in distributed systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Federated database systems for managing distributed, heterogeneous, and autonomous databases
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
On rigorous Transaction Scheduling
IEEE Transactions on Software Engineering
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Graph Algorithms
A Paradigm for Concurrency Control in Heterogeneous Distributed Database Systems
Proceedings of the Sixth International Conference on Data Engineering
On Serializability of Multidatabase Transactions Through Forced Local Conflicts
Proceedings of the Seventh International Conference on Data Engineering
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Application Specific Transaction Management in MultidatabaseSystems
Distributed and Parallel Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
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).