Concurrency Problem Generator

This page generates simple concurrency control schedules and asks you about their properties. Please note that these are just to help generate schedules for you to analyze, you should also understand the concepts themselves!

These problems do not cover anomalies due to aborts. Assume that transactions commit immediately after the last operation in the transaction.

  • (12/10/24) update: the old version used to only look for actual instances of unrepeatable reads (e.g., R-W-R patterns), which caused confusion. This has been updated to look for all instances of R-W patterns instead. In Fall 2024, you only need to identify conflicts between pairs of operations

Num Objects
Max num Operations per Xact
Designed for Columbia's W4111 Intro to Databases