Beyond Conflict Serializability: Blind Writes and View Equivalence
In database management systems, Conflict Serializability is the industry standard for verifying the correctness of concurrent schedules because it can be verified in polynomial time ( O(V + E) ) via Precedence Graphs.
However, Conflict Serializability is merely a sufficient condition, not a necessary one.
There exists a broader class of safe schedules: View Serializable Schedules .
1. The 3 Rules of View Equivalence
A concurrent schedule S is View Equivalent to a serial schedule S' if and only if it satisfies three strict invariants:
Initial Read : For each data item Q , if transaction T_i reads the initial value of Q in S , then T_i must also read the initial value of Q in S' .
Intermediate Read : If T_i reads a value of Q produced by T_j in S , then T_i must read the value produced by T_j in S' .
Final Write : For each data item Q , the transaction that performs the final write on Q in S must also perform the final write on Q in S'…