TheGateBook

Question

S1: R(A) W(A) W(B)
S2: R(A) W(A) R(B) W(B)

How many view serializable schedules are possible which are not conflict serializable?

(A) 0
(B) 1
(C) 2
(D) 3

Comments

For a schedule to be view and not conflict it must have atleast a blind write .

In s1 W(B) is the blind write,so we can have a single view serializable schedule .

But the answer key is 0 .Anyone can explain ?

---

if  schedule is not conflict serializable there is no blind write  then it is not view serilazalizable to become view serializable there must be blind write

---

In s1 W(B) is the blind write

---

Same https://gateoverflow.in/177951/view-serializability?show=177951#q177951