UGC-NET | UGC-NET CS 2017 Nov – III | Question 8
Suppose a database schedule S involves transactions T1, T2, ………….,Tn. Consider 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
Explanation: For a schedule, we can check its serializability by drawing a precedence graph and find its topological order, precedence graph of schedule must not contain any cycle to be conflict free.
So, option (A) is correct.
Quiz of this Question
My Personal Notes arrow_drop_up
Please Login to comment...