view serializable

Question

Consider the following transactions with data items P and Q initialized to zero:

T1T1	read (P); read (Q); if P = 0 then Q := Q + 1 ; write (Q).
T2T2	read (Q); read (P); if Q = 0 then P := P + 1 ; write (P)

Any non-serial interleaving of T₁ and T₂ for concurrent execution will be view serialiable?

Comments

You'll never get a blind write in any possible combination, right?

---

@rishabh yes

so its not view serialisable ?

---

Its not conflict serializable, so we check for blind writes.

Since we found no blind writes, so this shouldn't be view serializable.

If we found blind writes, we'd check for view serializability using polygraph.

This is as per my knowledge. Let me know if I missed something.

---

yes your right :)