Suppose a database schedule S involves transact...

Suppose a database schedule S involves transactions T1, ….Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?

(A) Topological order

(B) Depth-first order

(C) Breadth-first order

(D) Ascending order of transaction indices

0Comment