AWDIT: An Optimal Weak Database Isolation Tester
Lasse Møldrup, Andreas Pavlogiannis
Abstract
Database isolation is a formal contract concerning the level of data consistency that a database provides to its clients. In order to achieve low latency, high throughput, and partition tolerance, modern databases forgo strong transaction isolation for weak isolation guarantees. However, several production databases have been found to suffer from isolation bugs , breaking their data-consistency contract. Black-box testing is a prominent technique for detecting isolation bugs, by checking whether histories of database transactions adhere to a prescribed isolation level. In order to test databases on realistic workloads of large size, isolation testers must be as efficient as possible, a requirement that has initiated a study of the complexity of isolation testing. Although testing strong isolation has been known to be NP-complete, weak isolation levels were recently shown to be testable in polynomial time, which has propelled the scalability of testing tools. However, existing testers have a large polynomial complexity, restricting testing to workloads of only moderate size, which is not typical of large-scale databases. How efficiently can we provably test weak database isolation? In this work, we develop AWDIT, a highly-efficient and provably optimal tester for weak database isolation . Given a history H of size n and k sessions, AWDIT tests whether H satisfies the most common weak isolation levels of Read Committed (RC), Read Atomic (RA), and Causal Consistency (CC) in time O ( n 3/2 ), O ( n 3/2 ), and O ( n · k ), respectively, improving significantly over the state of the art. Moreover, we prove that AWDIT is essentially optimal , in the sense that there is a lower bound of n 3/2 , based on the combinatorial BMM hypothesis, for any weak isolation level between RC and CC. Our experiments show that AWDIT is significantly faster than existing, highly optimized testers; e.g., for the ∼20﹪ largest histories, AWDIT obtains an average speedup of 245×, 193×, and 62× for RC, RA, and CC, respectively, over the best baseline.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f7353181-634e-4226-a483-edafecd8b6c4Cited by top-tier papers5
- Efficient Decrease-and-Conquer Linearizability MonitoringLee Zheng Han, Umang MathurOOPSLA 2025 · 2 citations
- The Complexity of Testing Message-Passing ConcurrencyZheng Shi, Lasse Møldrup, Umang Mathur, Andreas PavlogiannisPOPL 2026 · 2 citations
- Fast Atomicity MonitoringHünkar Can Tunç, Yifan Dong, Andreas PavlogiannisPLDI 2026
- Augur: Predicting View Serializability Violations in Relational Data Store ApplicationsChujun Geng, Noah Charlton, Spyros Blanas, Michael D. Bond et al.OOPSLA 2026
- Fast Verification of Strong Database IsolationZhiheng Cai, Si Liu, Hengfeng Wei, Yuxing Chen et al.VLDB 2026
Builds on13
- Elle: Inferring Isolation Anomalies from Experimental ObservationsPeter Alvaro, Kyle KingsburyVLDB 2021 · 88 citations
- Cobra: Making Transactional Key-Value Stores Verifiably SerializableCheng Tan, Changgeng Zhao, Shuai Mu, Michael WalfishOSDI 2020 · 61 citations
- Fast, sound, and effectively complete dynamic race predictionAndreas PavlogiannisPOPL 2020 · 46 citations
- The Complexity of Dynamic Data Race PredictionUmang Mathur, Andreas Pavlogiannis, Mahesh ViswanathanLICS 2020 · 27 citations
- Efficient Black-box Checking of Snapshot Isolation in DatabasesKaile Huang, Si Liu, Zhenge Chen, Hengfeng Wei et al.VLDB 2023 · 18 citations
Related papers
- Plume: Efficient and Complete Black-Box Checking of Weak Isolation LevelsSi Liu, Long Gu, Hengfeng Wei, David A. BasinOOPSLA 2024 · 9 citations
- Boosting End-to-End Database Isolation Checking via Mini-TransactionsHengfeng Wei, Jiang Xiao, Na Yang, Si Liu et al.ICDE 2025 · 3 citations
- On the Complexity of Checking Mixed Isolation Levels for SQL TransactionsAhmed Bouajjani, Constantin Enea, Enrique Román-CalvoCAV 2025 · 3 citations
- IsoDiff: Debugging Anomalies Caused by Weak IsolationYifan Gan, Xueyuan Ren, Drew Ripberger, Spyros Blanas et al.VLDB 2020
- DBStorm: Generating Various Effective Workloads for Testing Isolation LevelsKeqiang Li, Siyang Weng, Lyu Ni, Chengcheng Yang et al.ISSTA 2024 · 5 citations
