Serialisation Graph,”A directed graph G = (N, E) for a transaction set T where: each node is a Transactions and edges show the conflicts. i.e. if T1 writes a value and T2 reads then: T1 → T2. If there are no cycles

Serialisation Graph,”A directed graph G = (N, E) for a transaction set T where: each node is a Transactions and edges show the conflicts. i.e. if T1 writes a value and T2 reads then: T1 → T2. If there are no cycles

the Schedule is serialisable.”