Suppose a database schedule S involves transactions \(T_1, ..., T_n\).…

PYQ GATE 2016

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

  1. A.

    Topological order

  2. B.

    Depth-first order

  3. C.

    Breadth-first order

  4. D.

    Ascending order of transaction indices

Attempted by 989 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…