Dependency Graph

What
A dependency graph is a representation of a schedule that is used to find if that schedule is? conflict serializable.

Set Up

 * Each transaction is a node
 * A directed edge goes from $$T_i$$ to $$T_j$$ if an action in $$T_i$$? conflicts? with an action in $$T_j$$ and the action in $$T_i$$ is earlier in the schedule.

Implications

 * A dependency graph that has no cycles is conflict serializable