Serialization Graphs
A serialization graph, SG(H), for history H tells the effective execution order of transactions in H.
Given history H, SG(H) is a directed graph whose nodes are the committed transactions and whose edges are all Ti ? Tk such that at least one of Ti’s operations precedes and conflicts with at least one of Tk’s operations
H6 = r1[x] r2[x] w1[x] r3[x] w2[y] w3[x] c3 w1[y] c1 c2