Problem
Research questions and friction points this paper is trying to address.
View Serializability
relational queries
data store applications
weak isolation
Augur: Predicting View Serializability Violations in Relational Data Store Applications
🤖 AI Summary
本文提出Augur，一种动态预测程序分析方法，用于检测关系数据存储应用中违反视图可序列化的行为，特别是支持复杂SQL查询的情况。
📝 Abstract
Data stores are widely used because they provide persistence, scalability, and fault tolerance with a simple interface. However, most data store applications configure the data store to use weak isolation to achieve scalable performance, resulting in sporadic unserializable executions that are incorrect or fail. Prior work uses dynamic predictive analysis to infer violations from execution traces, but it cannot handle relational (i.e., SQL) queries with complex predicates, and it predicts executions that do not violate View Serializability.
This paper introduces Augur, the first dynamic predictive program analysis that (1) supports data store applications with complex relational queries and (2) reports only executions that violate View Serializability. The evaluation demonstrates that Augur finds feasible, unserializable executions in the widely used OLTP-Bench programs and in the widely used e-commerce application Spree.
Innovation
Methods, ideas, or system contributions that make the work stand out.
dynamic predictive analysis
view serializability
relational queries
🔎 Similar Papers
No similar papers found.
