Database Management Systems · Transactions and concurrency

Conflict-serializability

Checking whether an interleaved schedule of transactions could have happened in some one-at-a-time order instead.

Also known as: precedence graph, schedule serializability.

Start a lesson on Conflict-serializability

Learn first

• Concurrency anomalies: The specific bad things that can happen when two transactions run at the same time: dirty, non-repeatable, and phantom reads.

Leads to

• Lock-based concurrency control: Transactions acquiring then releasing locks on data, in two strict phases, to enforce serializability in practice.

Related topics

• Lock-based concurrency control: Transactions acquiring then releasing locks on data, in two strict phases, to enforce serializability in practice.
• Isolation levels: How much of those concurrency anomalies a database is willing to allow, chosen as a tradeoff against speed.