edited by
764 views
0 votes
0 votes

Suppose a schedule is not conflict serializable but has blind writes, only this condition is sufficient to declare the schedule as view serializable or we have to manually check for view serializability???

edited by

2 Answers

Best answer
2 votes
2 votes
Consider the schedule:

T1        T2

---------------------

R(A)

         W(A)

W(A)

 

Now, T2 is performing blind write. But the dependencies are follows to check for view serializability:

1)  T1->T2     for the W(A) operation of T2 after the initial R(A) operation of T1.

2)  T2->T1     for the final W(A) operation of T1 after the W(A) operation of T2.

Now, we have a cycle and hence, not view seriazable.
selected by
2 votes
2 votes
Having blind writes is not sufficient condition to declare View Serializability. We need to draw polygraph and check if there are'nt any cycles in the polygraph, then only we can declare its View Serializable.

Related questions

2 votes
2 votes
1 answer
1
Prajwal Bhat asked Sep 5, 2016
982 views
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializableBut still wanted to know what is the view ser...
0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
3
bhucho asked Sep 13, 2023
259 views
please can someone help with part (a) of this question.
0 votes
0 votes
1 answer
4
chinmay_rajpurohit asked Mar 2, 2023
629 views
2NF , 3NF, BCNF decomposition allowed if lossless and dependency preserving , both conditions must preserve. Otherwise given decomposition wrong for normal forms. Is this...