Use a serialization graph to demonstrate that the schedule shown in Figure 20.4 is not conflict serializable.

What will be an ideal response?

The serialization graph has an edge
T1 ? T2
because T1 wrote x before T2 wrote it, and it has an edge
T2 ? T1
because T2 read y before T1 wrote it. Thus the graph has a cycle and the schedule is
not conflict serializable.