CSE Roadmap

Specialist tier · about 2 hours · 5 parts

Part 1 of 5 · 1 min read

Why this page comes first

In this module you will

  • Explain how timestamp ordering uses transaction timestamps to decide whether an operation is allowed.
  • Explain Thomas' write rule, and what extra case it allows compared to plain timestamp ordering.
  • Explain the three phases of optimistic concurrency control, and when conflicts are actually checked.
  • Compare locking, timestamp ordering, and optimistic concurrency control on when conflicts are detected.

The previous page covered locking, which prevents conflicts by making transactions wait. This page covers two alternative families of protocol that also guarantee serializability, but detect conflicts differently. One compares timestamps as operations happen; the other checks for conflicts only once, at the very end.