Content deleted Content added
→Unrecoverable: Improved explanation and made headings better organized. |
→Conflict-serializable: Made sure that each distinct schedule had a distinct variable name |
||
Line 186:
Equivalently, a schedule is conflict-serializable if and only if its [[precedence graph]] is acyclic when only committed transactions are considered. Note that if the graph is defined to also include uncommitted transactions, then cycles involving uncommitted transactions may occur without conflict serializability violation.
{| class="wikitable"
|+
!T1
!T2
Line 210 ⟶ 212:
|Com.
|}
▲Which is conflict-equivalent to the serial schedule <T1,T2>, but not <T2,T1>.
====Commitment-ordered====
Line 384:
!F2: T1
!F2: T2
!
!
|-
|R(A)
| |||