Menu
View Serializability. 1. Two schedules are said to be conflict equivalent if all the conflicting operations in both the schedule get executed in the same order. If a schedule is a conflict equivalent to its serial schedule then it is called Conflict Serializable Schedule.
A schedule will view serializable if it is view equivalent to a serial schedule. If a schedule is conflict serializable, then it will be view serializable. The view serializable which does not conflict serializable contains blind writes.
View serializability is a concept that is used to compute whether schedules are View-Serializable or not. A schedule is said to be View-Serializable if it is view equivalent to a Serial Schedule (where no interleaving of transactions is possible).
Every conflict serializable schedule is also view serializable. Below is a schedule which is view-serializable but not conflict serializable. What serial schedule is above equivalent to? Every view serializable schedule that is not conflict serializable has blind writes.
I was reading about serializability in schedules of transactions and therefore read about conflict serializable and view serializable schedules.
Now because conflict serializable is more stringent than view serializable , it is obvious that there will be schedules that are view serializable but not conflict serializable.In the book I read the following:
Blind writes appear in any schedule that is view serializable but not conflict seralizable.
I have been trying to come up with a proof of the above statement but could not do it.
My question is : Is there a formal proof of the above mentioned statement?
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With