DBScholar

Back to papers

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)

Paper ID
h4c8ac06048e08ac6
Venue
CIDR
Year
2015
Pagerank
4.9793485e-05
Overall Rank
12,379 | 16.78%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{bailis_cidr15,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '15},
        title = {{The Case for Invariant-Based Concurrency Control}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Bailis, Peter},
        year = {2015}
}

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
70 The End of an Architectural Era (It’s Time for a Complete Rewrite) 2007 VLDB 0.00037859131
711 An Optimality Theory of Concurrency Control for Databases 1979 SIGMOD 0.00014608112
807 Coordination Avoidance in Database Systems 2015 VLDB 0.00013778758
1,194 Highly Available Transactions: Virtues and Limitations 2014 VLDB 0.00011586405
1,947 Scalable Atomic Visibility with RAMP Transactions 2014 SIGMOD 9.3241479e-05
Previous Page 1 / 1 Next

Semantically Similar Papers