(1) If the graph contains no cycles, the schedule is view serializable.
(2) The presence of a cycle, however, is not a sufficient condition to conclude that the schedule is not view serializable. The actual test is based on the observation that rule6(c) generates m distinct directed edge pairs, resulting in 2m different graphs contain-ing just one edge from each pair. If any one of these graphs is acyclic, then the corre-sponding schedule is view serializable and the serializability order is determined by the topological sorting of the graph with the dummy transactions Tbw and Tfr removed.