Suppose a database schedule S involves transactions T1,........,Tn. Construct…

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? 

  1. A.

    Topological order 

  2. B.

    Depth-first order 

  3. C.

    Breadth- first order 

  4. D.

    Ascending order of the transaction indices 

Attempted by 389 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…