Page History

...

Conflict serializability is sucient but not necessary for serializability. A more general sucient condition is view serializability.

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

Intuitively, two schedules are equivalent if the executions that produced them leave the database in the same state. The formal definition of equivalence is:

...

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.

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

T1 = w1[x] a1, T2 = r2[x] w2[x] c2

...