Part 1 of 5 · 1 min read
Why this page comes first
In this module you will
- Define a schedule, and distinguish a serial schedule from an interleaved one.
- Explain conflict serializability, and how a precedence graph tests for it.
- Distinguish recoverable, cascadeless, and strict schedules from each other.
- Determine, for a small example schedule, whether it is conflict serializable.
The previous page defined isolation only informally: concurrent transactions should not see each other's incomplete changes in ways that break correctness. This page gives that idea a precise, checkable definition, which the rest of this level's isolation levels and locking protocols are built to satisfy.