1.

The set of ________ in a precedence graph consists of all the transactions participating in the schedule(a) Vertices(b) Edges(c) Directions(d) None of the mentionedThis question was addressed to me in an international level competition.Question is from Serializability in portion Transactions of RDBMS

Answer» CORRECT choice is (a) VERTICES

Explanation: The set of vertices in a precedence graph consists of all the transactions PARTICIPATING in the schedule. Precedence graph is a simple and efficient way of determining CONFLICT serializability of the schedule.


Discussion

No Comment Found

Related InterviewSolutions