Checking read committed, read atomic, and causal consistency is polynomial-time, while prefix consistency and snapshot isolation are NP-complete, with polynomial algorithms when session counts are fixed.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Complexity of Checking Transactional Consistency
Checking read committed, read atomic, and causal consistency is polynomial-time, while prefix consistency and snapshot isolation are NP-complete, with polynomial algorithms when session counts are fixed.