Ramp-Tao

Cheng, Audrey; Shi, Xiao; Pan, Lu; Simpson, Anthony; Wheaton, Neil; Lawande, Shilpa; Bronson, Nathan; Bailis, Peter; Crooks, Natacha; Stoica, Ion

doi:10.14778/3476311.3476379

Cited by 6 publications

(2 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many industrial databases have integrated read-atomic transactions as an important building block. For example, RAMP-TAO [12] has recently layered RA on Facebook's TAO data store [9] to provide atomically visible and highly available transactions.…”

Section: Sermentioning

confidence: 99%

See 1 more Smart Citation

NOC-NOC: Towards Performance-optimal Distributed Transactions

Liu,

Multazzu,

Wei

et al. 2024

Proc. ACM Manag. Data

View full text Add to dashboard Cite

Substantial research efforts have been devoted to studying the performance optimality problem for distributed database transactions. However, they focus just on optimizing transactional reads, and thus overlook crucial factors, such as the efficiency of writes, which also impact the overall system performance. Motivated by a recent study on Twitter's workloads showing the prominence of write-heavy workloads in practice, we make a substantial step towards performance-optimal distributed transactions by also aiming to optimize writes, a fundamentally new dimension to this problem. We propose a new design objective and establish impossibility results with respect to the achievable isolation levels. Guided by these results, we present two new transaction algorithms with different isolation guarantees that fulfill this design objective. Our evaluation demonstrates that these algorithms outperform the state of the art.

show abstract

Section: Sermentioning

confidence: 99%

“…Read atomicity is an even newer isolation guarantee. In addition to its already wide range of applications in practice, including secondary indexing, foreign key enforcement, and materialized view maintenance [5], read-atomic transactions have recently been deployed atop Facebook's TAO [12].…”

Section: Examining Existing Transaction Algorithmsmentioning

confidence: 99%

NOC-NOC: Towards Performance-optimal Distributed Transactions

Liu,

Multazzu,

Wei

et al. 2024

Proc. ACM Manag. Data

View full text Add to dashboard Cite

show abstract

All in One: Design, Verification, and Implementation of SNOW-optimal Read Atomic Transactions

Liu

2022

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

Distributed read atomic transactions are important building blocks of modern cloud databases that magnificently bridge the gap between data availability and strong data consistency. The performance of their transactional reads is particularly critical to the overall system performance, as many real-world database workloads are dominated by reads. Following the SNOW design principle for optimal reads, we develop LORA, a novel SNOW-optimal algorithm for distributed read atomic transactions. LORA completes its reads in exactly one round trip, even in the presence of conflicting writes, without imposing additional overhead to the communication, and it outperforms the state-of-the-art read atomic algorithms. To guide LORA’s development, we present a rewriting-logic-based framework and toolkit for design, verification, implementation, and evaluation of distributed databases. Within the framework, we formalize LORA and mathematically prove its data consistency guarantees. We also apply automatic model checking and statistical verification to validate our proofs and to estimate LORA’s performance. We additionally generate from the formal model a correct-by-construction distributed implementation for testing and performance evaluation under realistic deployments. Our design-level and implementation-based experimental results are consistent, which together demonstrate LORA’s promising data consistency and performance achievement.

show abstract

Plume: Efficient and Complete Black-Box Checking of Weak Isolation Levels

Liu,

Gu,

Wei

et al. 2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Modern databases embrace weak isolation levels to cater for highly available transactions. However, weak isolation bugs have recently manifested in many production databases. This raises the concern of whether database implementations actually deliver their promised isolation guarantees in practice. In this paper we present Plume, the first efficient, complete, black-box checker for weak isolation levels. Plume builds on modular, fine-grained, transactional anomalous patterns, with which we establish sound and complete characterizations of representative weak isolation levels, including read committed, read atomicity, and transactional causal consistency. Plume leverages a novel combination of two techniques, vectors and tree clocks, to accelerate isolation checking. Our extensive assessment shows that Plume can reproduce all known violations in a large collection of anomalous database execution histories, detect new isolation bugs in three production databases along with informative counterexamples, find more weak isolation anomalies than the state-of-the-art checkers, and efficiently validate isolation guarantees under a wide variety of workloads.

show abstract

Ramp-Tao

Cited by 6 publications

References 37 publications

NOC-NOC: Towards Performance-optimal Distributed Transactions

NOC-NOC: Towards Performance-optimal Distributed Transactions

All in One: Design, Verification, and Implementation of SNOW-optimal Read Atomic Transactions

Plume: Efficient and Complete Black-Box Checking of Weak Isolation Levels

Contact Info

Product

Resources

About