Everything about Commitment ordering
Concurrency control technique for databases
Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related applications. It allows optimistic (non-blocking) implementations. With the proliferation of multi-core processors, CO has also been increasingly utilized in concurrent programming, transactional memory, and software transactional memory (STM) to achieve serializability optimistically. CO is also the name of the resulting transaction schedule (history) property, defined in 1988 with the name dynamic atomicity. In a CO compliant schedule, the chronological order of commitment events of transactions is compatible with the precedence order of the respective transactions. CO is a broad special case of conflict serializability and effective means to achieve global serializability across any collection of database systems that possibly use different concurrency control mechanisms. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Commitment orderingA 5-minute orientation
- Skim a recent paper: ZkDelay Mitigating Transaction-Ordering Dependence Using Commitment Schemes and Verifiable Delay Functions in Smart ContractsInfluential work since 2022
- Pick up a classic book: Public order bill 1986The most-reprinted book on the subject
- Read the landmark paper: ON THE CAUSAL ORDERING OF JOB SATISFACTION AND ORGANIZATIONAL COMMITMENT.Cited 371 times
- Go sideways: Concurrency controlA closely related topic
- Go sideways: Global serializabilityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
ON THE CAUSAL ORDERING OF JOB SATISFACTION AND ORGANIZATIONAL COMMITMENT.
A three-wave longitudinal analysis of the causal ordering of satisfaction and commitment on turnover decisions.
Causal ordering of stress, satisfaction and commitment, and intention to quit: a structural equations analysis
Temporal Ordering of Supportive Dyadic Coping, Commitment, and Willingness to Sacrifice
Serializability by commitment ordering
An investigation of the causal ordering of job satisfaction and organizational commitment in...
Two-Stage Ordering Policy under Buyer’s Minimum-Commitment Quantity Contract
A Concurrency Control Method Based on Commitment Ordering in Mobile Databases
🆕 Influential since 2022
📚 Books worth reading
- 📕Public order bill 1986Rand McNally · 1986
Pre-tsarist and tsarist Central AsiaPaul Georg Geiss · 2003- 📕Mr. Livingston's motionEdward Livingston · 1800
- 📕Report of the Committee of Claims, on the petition of Oliver PollockUnited States. Congress. House. Committee on Claims · 1796
AuschwitzLaurence Rees · 2005- 📕Court-Ordered InsanityJames A. Holstein · 2020
Tangle of hopesErnst B. Haas · 1967
Fallen OrderKaren Liebreich · 2004
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Concurrency control In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency…
- Global serializability In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, global serializability…
- Two-phase commit protocol In transaction processing, databases, and computer networking, the two-phase commit protocol (2PC, tupac) is a type of atomic commitment protocol (ACP)…
- Database transaction schedule In the fields of databases and transaction processing (transaction management), a schedule (or history) of a system is an abstract model to describe the…
- Quorum (distributed computing) A quorum is the minimum number of votes that a distributed transaction has to obtain in order to be allowed to perform an operation in a distributed system…
- Two-phase locking In databases and transaction processing, two-phase locking (2PL) is a pessimistic concurrency control method that guarantees conflict-serializability.…
- Transactional memory In computer science and engineering, transactional memory attempts to simplify concurrent programming by allowing a group of load and store instructions…
- Distributed transaction A distributed transaction operates within a distributed environment, typically involving multiple nodes across a network depending on the location of the…