Given the following transaction schedule, I have to determine whether it is serializable or not:
The solution to the problem says:
Since T1 read B and T2 writes to B before the end of T1, it is not serializable.
However, the requirement for serializability, as far as I know is:
A serializable schedule over a set S of commited transactions is a schedule whose effect on any consistent database instance is guaranteed to be identical to that of some complete serial schedule over S.
Since T1 only reads and aborts, it does not have any effect on the database instance. So is the solution wrong, or am I missing something?