The Case for Invariant-Based Concurrency Control
Summary: Proposes using application invariants to determine when coordination is necessary, enabling coordination-free execution and far better scalability than serializability for many workloads. Classifies which invariants need coordination, reports 25× TPC‑C speedups, and outlines enforcement and analysis challenges. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Peter Bailis
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 86 | The End of an Architectural Era (It's Time for a Complete Rewrite) | 2007 | VLDB | 0.00052563276 |
| 347 | An Optimality Theory of Concurrency Control for Databases | 1979 | SIGMOD | 0.00026610677 |
| 1,028 | Coordination Avoidance in Database Systems | 2015 | VLDB | 0.00014584518 |
| 1,419 | Highly Available Transactions: Virtues and Limitations | 2014 | VLDB | 0.00012079793 |
| 2,273 | Scalable Atomic Visibility with RAMP Transactions | 2014 | SIGMOD | 9.1329997e-05 |
Previous
Page 1 / 1
Next