Page History

...

It can be shown that any view serializable schedule that is not conflict serializable contains a blind write. Blind write is simply when a transaction writes without reading.

Enforcing or testing view serializability turns out to be much more expensive, and the concept therefore has little practical use.

TBD

T1=r1[x] w1[x], T2=r2[x] w2[x]

S = r2[x] r1[x] w2[x] w1[x]

Until now we have talked about schedules having only committed transactions. We must also take into consideration schedules containing aborted transactions. Consider two transactions

...