...

A schedule S is conflict serializable if and only if its precedence graph is acyclic. An equivalent serial schedule in this case is given by any topological sort over the precedence graph.

...

S  is not serializable schedule., because it's not equivalent neither T1, T2 nor T2, T1

Until now we have talked about schedules having only committed transactions. We must also take into consideration schedules containing aborted transactions. 

...

Such schedule is unrecoverable, because if the T2 is committed and it can't be undone on T1 abort.

...

For a schedule to be recoverable, it's necessary to read only committed data. Recoverable schedules also avoid cascading aborts.

TBD strict schedules

CC protocols WIP

MV2PL (S2PL vs non-S2PL)

MVOCC (SNAPSHOT)

MVTO

SNAPSHOT

SGT

Description

// Provide the design of the solution.

...