Robustness against read committed for transaction templates
نویسندگان
چکیده
The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, workloads can be safely executed under RC obtaining the perfect of serializability at lower cost RC. To identify such cases, we introduce an expressive model programs better reason about transactional workloads. We develop tractable algorithms decide whether any possible schedule a workload serializable (referred as robustness problem). Our approach yields robust subsets that are larger than those identified previous methods. provide experimental evidence against evaluated faster compared stronger levels. discuss techniques making promoting selective read operations updates. Depending on scenario, performance improvements considerable. Robustness testing and executing transactions therefore direct way increase throughput without changing DBMS internals.
منابع مشابه
Upper Bounds for Robustness of CNN Templates and a Design Approach for Robust Templates
Abstruct — CNNS constitute a class of spatially discrete, nonlinear dynamic systems. Once the inputs and the states are initialized, the dynamic of a CNN is determined by a set of parameters, so-called templates. We investigate issues concerning the dynamic behavior of a CNN due to variations in template values. In particular, we derive, based on the output invariance at the equilibrium, upper ...
متن کاملTransaction Support in Read Optimizied and Write Optimized File Systems
This paper provides a comparative analysis of five implementations of transaction support. The first of the methods is the traditional approach of implementing transaction processing within a data manager on top of a read optimized file system. The second also assumes a traditional file system but embeds transaction support inside the file system. The third model considers a traditional data ma...
متن کاملChecking Robustness against TSO
We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics. We provide a complete characterization of non-robustness in terms of so-called attacks: a restricted form of (harmful) out-of-program-ord...
متن کاملRobustness against inefficient manipulation
This paper identifies a family of scoring rules that are robust against coalitional manipulations that result in inefficient outcomes. We discuss the robustness of a number of Condorcet consistent and “point runoff” voting rules against such inefficient manipulation and classify voting rules according to their potential vulnerability to inefficient manipulation.
متن کاملTransaction Support in Read Optimized and Write Optimized File Systems
This paper provides a comparative analysis of five implementations of transaction support. The first of the methods is the traditional approach of implementing transaction processing within a data manager on top of a read optimized file system. The second also assumes a traditional file system but embeds transaction support inside the file system. The third model considers a traditional data ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2021
ISSN: ['2150-8097']
DOI: https://doi.org/10.14778/3476249.3476268