in Databases edited by
914 views
1 vote
1 vote

Whether the given schedule is conflict serializable or view serializable or none.

in Databases edited by
by
914 views

4 Comments

In your last link, in all the examples, the commit statements are at the last. So those are not good counter examples.

See this. Explained. https://gateoverflow.in/100871/precedence-graph

1
1
I understand. But if possible can you give some reason why this happens? I mean if you consider the given question it does actually matter whether Write A of T2 is after read of T1 or not. Do you have any idea about why introduction of commit changes things?
0
0
@asdfghjk I am not aware of the reason. Sorry!!
0
0

2 Answers

0 votes
0 votes
View Serialzble

1 comment

How this is view serializable. t2 is dependent on t1 since intial read is performed by t1 , but t2 commits before t1.
0
0
0 votes
0 votes

there is no cycle is precedence graph of this schedule , hence it is conflict serializable.

but every conflict is also view serializable . therefor OPTION – C