Question
Download Solution PDFSuppose a database schedule 5 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 ?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is option 1
Key Points
- For a schedule to be conflict serializable, there should be no cycle present in the precedence graph.
- Topological sort is not possible for the cyclic graph.
- Hence topological ordering of the vertices is guaranteed to yield a serial schedule.
Additional Information
- BFS and DFS are also possible for cyclic graphs.
- Ascending order of transactions indices also does not guarantee serial a serial schedule because in a transaction more indices might come before the lower one.
Last updated on Jun 22, 2025
-> The UGC Net Admit Card has been released on its official website today.
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.