time ordering protocol with thomas' write rule allow view serializable schedules which are not conflict serializable. it ignores W-W conflict in the end.
example: R1(Y)W2(X)W1(X)W2(Y)
T1 comes before T2. this schedule is view equivalent to T2-T1 but not conflict serializable.
