265 views
0 votes
0 votes

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!!

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
JAINchiNMay asked Dec 1, 2022
402 views
Any attribute(s) determining a prime attribute, automatically becomes a prime(s) attributeTrue or false
1 votes
1 votes
1 answer
2
Manisha Jaishwal asked Aug 10, 2022
333 views
S:- R1(x) R1(y) W1(x) R2(z) R2(y) W3(y) R2(y)Schedule is view Serializable or not ?
0 votes
0 votes
0 answers
3
_Bash_ asked Apr 2, 2019
446 views
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent sch...
0 votes
0 votes
0 answers
4
codingo1234 asked Apr 8, 2019
239 views
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?