Content deleted Content added
→Serializable: Included information from the serializability Wikipedia article |
→Commitment-order-serializable: included reference to the main article |
||
Line 219:
|}
==== Commitment-order-serializable ====
{{main|Commitment ordering}}
A schedule is said to be commitment-ordered (commit-ordered), or commitment-order-serializable, if it obeys the [[Commitment ordering]] (CO; also commit-ordering or commit-order-serializability) schedule property. This means that the order in time of transactions' commitment events is compatible with the precedence (partial) order of the respective transactions, as induced by their schedule's acyclic precedence graph (serializability graph, conflict graph). This implies that it is also conflict-serializable. The CO property is especially effective for achieving [[Global serializability]] in distributed systems.
| |||