Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring
Serializability is a well-understood concurrency control mechanism that eases reasoning about highly-concurrent database programs. Unfortunately, enforcing serializability has a high performance cost, especially on geographically distributed database clusters. Consequently, many databases allow programmers to choose when a transaction must be executed under serializability, with the expectation that transactions would only be so marked when necessary to avoid serious concurrency bugs. However, this is a significant burden to impose on developers, requiring them to (a) reason about subtle concurrent interactions among potentially interfering transactions, (b) determine when such interactions would violate desired invariants, and (c) then identify the minimum number of transactions whose executions should be serialized to prevent these violations. To mitigate this burden, this paper presents a sound fully-automated schema refactoring procedure that refactors a program’s data layout – rather than its concurrency control logic – to eliminate statically identified concurrency bugs, allowing more transactions to be safely executed under weaker and more performant database guarantees. Experimental results over a range of realistic database benchmarks indicate that our approach is highly effective in eliminating concurrency bugs, with safe refactored programs showing an average of 120% higher throughput and 45% lower latency compared to a serialized baseline.
Fri 22 OctDisplayed time zone: Central Time (US & Canada) change
13:50 - 15:10 | PLDI 2021 Papers 5SIGPLAN Papers at Zurich F Chair(s): Feras Saad Massachusetts Institute of Technology | ||
13:50 15mTalk | Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring SIGPLAN Papers Kia Rahmani Purdue University, Kartik Nagar IIT Madras, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University | ||
14:05 15mTalk | Scooter & Sidecar: A domain-specific approach to writing secure migrations SIGPLAN Papers John Renner University of California at San Diego, USA, Alex Sanchez-Stern University of California at San Diego, Fraser Brown Stanford University, USA, Sorin Lerner University of California at San Diego, Deian Stefan University of California at San Diego, USA | ||
14:20 15mTalk | Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints SIGPLAN Papers Caleb Stanford University of Pennsylvania, Margus Veanes Microsoft, Nikolaj Bjørner Microsoft Research | ||
14:35 15mTalk | Filling Typed Holes with Live GUIs SIGPLAN Papers Cyrus Omar University of Michigan, David Moon University of Michigan, Andrew Blinn University of Michigan, Ian Voysey Carnegie Mellon University, Nick Collins University of Chicago, Ravi Chugh University of Chicago | ||
14:50 20mLive Q&A | Discussion, Questions and Answers SIGPLAN Papers |