Database Paper Browser

Back to papers

Deciding Robustness for Lower SQL Isolation Levels

Summary: Characterizes robustness of transaction sets against read uncommitted and read committed by absence of specific counterexample schedules (split, multi-split) and cycles in order-sensitive interference graphs, unlike SI where atomic visibility simplifies analysis. Proves read-committed robustness is coNP-complete while read-uncommitted is LOGSPACE-complete. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1786
Venue
PODS
Year
2020
Pagerank
4.2783272e-05
Overall Rank
9,816 | 31.72%
DOI
10.1145/3375395.3387655

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
23 A Critique of ANSI SQL Isolation Levels 1995 SIGMOD 0.00083894938
1,419 Highly Available Transactions: Virtues and Limitations 2014 VLDB 0.00012079793
2,648 Allocating Isolation Levels to Transactions 2005 PODS 8.3731376e-05
Previous Page 1 / 1 Next

Semantically Similar Papers