Suppose a database schedule S involves transactions \(T_1, ..., T_n\).…
GATE · 2016 · CS · Set 2 · Computer Science & IT
Suppose a database schedule S involves transactions . Construct the precedence graph of with vertices representing the transactions and edges representing the conflicts. If 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
Attempted by 860 students.
Sign up free to check your answer
Sign up freeLoading lesson…