Database precedence graph
= Database precedence graph
A <directed graph> with a vertex for each <database transaction> and an edge from the earlier to the later participant in each conflicting pair of operations. A <database schedule> is a <conflict-serializable database schedule> exactly when this <directed graph> has no directed cycle.