The Gateway to Computer Science Excellence
0 votes
19 views

In this Question , it is said that S is serializable….. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, then the precedence graph will be cyclic and we cannot use topological sort to get a serial schedule …….. then how come the answer is (A). Topological sort….. Please Help!!

in Databases by (63 points) | 19 views
0
If serializability is being implied only through the precedence graph , then we can surely say that the schedule is conflict serializable , acyclic nature of the precedence graph doesn't ensure view serializability.
0
"Being implied only through the precedence graph" didn't understand this line with regard to the question.

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,531 answers
195,625 comments
101,353 users