Aria: a fast and practical deterministic OLTP database
Name
3407790.3407808.pdf
Description
Published version
Size
491.13 KB
Format
Adobe PDF
Checksum (MD5)
abbc1623e10d324d5d9b44ec27ac8e42
Author(s)
Lu, Yi
Yu, Xiangyao
Cao, Lei
Madden, Samuel
Date Issued
2020
Journal
Proceedings of the VLDB Endowment
Publisher
VLDB Endowment
Version
Final published version
Abstract
© 2020, VLDB Endowment. Deterministic databases are able to efficiently run transactions across different replicas without coordination. However, existing state-of-the-art deterministic databases require that transaction read/write sets are known before execution, making such systems impractical in many OLTP applications. In this paper, we present Aria, a new distributed and deterministic OLTP database that does not have this limitation. The key idea behind Aria is that it first executes a batch of transactions against the same database snapshot in an execution phase, and then deterministically (without communication between replicas) chooses those that should commit to ensure serializability in a commit phase. We also propose a novel deterministic reordering mechanism that allows Aria to order transactions in a way that reduces the number of con icts. Our experiments on a cluster of eight nodes show that Aria outperforms systems with conventional nondeterministic concurrency control algorithms and the state-of-the-art deterministic databases by up to a factor of two on two popular benchmarks (YCSB and TPC-C).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.14778/3407790.3407808
