The conflict serializability can be determined by ______ of the graph containing READs and WRITEs of transactions of a schedule as vertices and READ-WRITE, WRITE-READ and ______ in the time order as edges
- acyclicity, READ-READ
- cyclicity, READ-WRITE
- cyclicity, WRITE-READ
- acyclicity, WRITE-WRITE