Conflict serializability is a powerful way to judge whether a concurrent schedule is safe, but there are some correct schedules that conflict serializability cannot classify. To catch more of these “safe” schedules, DBMS introduces view serializability.
View serializability is a broader correctness criterion than conflict serializability: every conflict serializable schedule is also view serializable, but the reverse is not always true.
What Does “View” Mean?
In view serializability, the word “view” refers to what values transactions read and write and which transactions perform the final write on each data item.
Two schedules are view equivalent if, for each data item and each transaction, the following conditions are the same in both schedules:
Initial read
Which transaction first reads the initial value of a data item.
Final write
Which transaction last writes the final value of a data item.
Intermediate reads
Which transaction’s writes are read by which other transactions in the same order.
If two schedules have the same “view” on these points, they are considered view equivalent, even if the exact order of operations is different.
What Is a View Serializable Schedule?
A schedule is view serializable if it is view equivalent to some serial schedule.
In simple terms:
“Even though operations are interleaved, the pattern of reads and writes is the same as if the transactions had run one after another in some order.”
Because view serializability is based on the effect of values (not just conflicts), it can accept some schedules that are not conflict serializable but are still logically correct.
Example Idea (Conceptual)
Imagine two transactions both read and write the same data item A. Conflict serializability may reject some orderings because of write‑write conflicts, but if the initial and final reads/writes match a serial schedule, view serializability can still accept it.
For beginners, think of view serializability as a finer‑grained way to check correctness: it asks, “Does each transaction see the same sequence of values as it would in some serial order?”
Conflict Serializability vs View Serializability
Why View Serializability Matters?
It extends the number of safe, correct schedules that can be allowed.
It helps database theorists understand exactly how far concurrency can go without breaking correctness.
For beginners, it shows that conflict serializability is not the only way to define a “good” schedule; there is a wider class of correct schedules captured by view serializability.
Summary
View serializability in DBMS is a correctness criterion for concurrent schedules that says a schedule is view serializable if it has the same read/write pattern (the “view”) as some serial schedule. It is a broader concept than conflict serializability: every conflict serializable schedule is view serializable, but some view serializable schedules are not conflict serializable. This idea helps DBMS designers and theorists draw a more complete picture of which interleaved schedules preserve correctness while still allowing concurrency.