Lion: Minimizing Distributed Transactions Through Adaptive Replica Provision
Qiushi Zheng, Zhanhao Zhao, Wei Lu, Chang Yao, Yuxing Chen, Anqun Pan, Xiaoyong Du
摘要
Distributed transaction processing often involves multiple rounds of cross-node communications, and therefore, tends to be slow. To improve performance, existing approaches convert distributed transactions into single-node transactions by either migrating co-accessed partitions onto the same nodes or establishing a super node housing replicas of the entire database. However, migration-based methods might cause transactions to be blocked due to waiting for data migration, while the super node can become a bottleneck.
In this paper, we present Lion, a novel transaction processing protocol that utilizes partition-based replication to reduce the occurrence of distributed transactions. Inspired by the fact that modern distributed databases horizontally partition data, with each partition having multiple replicas, Lion aims to assign a node with one replica from each partition involved in a given transaction's read or write operations. To ensure such a node is available, we propose an adaptive replica provision mechanism, enhanced with an LSTM-based workload prediction algorithm, to determine the appropriate node for locating replicas of co-accessed partitions. The adaptation of replica placement is conducted preemptively and asynchronously, thereby minimizing its impact on performance. By employing this adaptive replica placement strategy, we ensure that the majority of transactions can be efficiently processed on a single node without additional overhead. Only a small fraction of transactions will need to be treated as regular distributed transactions when such a node is unavailable. Consequently, Lion effectively minimizes distributed transactions, while avoiding any disruption caused by data migration or the creation of a super node. We conduct extensive experiments to compare Lion against various transaction processing protocols. The results show that Lion achieves up to 2.7x higher throughput and 76.4% better scalability against these state-of-the-art approaches.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- TxnSails: Achieving Serializable Transaction Scheduling with Self-Adaptive Isolation Level SelectionQiyu Zhuang, Wei Lu, Shuang Liu, Yuxing Chen 等VLDB 2025 · 被引用 1 次
- Chimera: Mitigating Ownership Transfers in Multi-Primary Shared-Storage Cloud-Native DatabasesHuang Chunyue, Shuang Liu, Xinyi Zhang, Wenhao Li 等VLDB 2025 · 被引用 1 次
它引用的顶会 Paper10
- Epoch-based Commit and Replication in Distributed OLTP DatabasesYi Lu, Xiangyao Yu, Lei Cao, Samuel MaddenVLDB 2021 · 被引用 52 次
- Caracal: Contention Management with Deterministic Concurrency ControlDai Qin, Angela Demke Brown, Ashvin GoelSOSP 2021 · 被引用 37 次
- Efficient Distributed Transaction Processing in Heterogeneous NetworksQian Zhang, Jingyao Li, Hongyao Zhao, Quanqing Xu 等VLDB 2023 · 被引用 25 次
- MorphoSys: Automatic Physical Design Metamorphosis for Distributed Database SystemsMichael Abebe, Brad Glasbergen, Khuzaima DaudjeeVLDB 2020 · 被引用 18 次
- Don't Look Back, Look into the Future: Prescient Data Partitioning and Migration for Deterministic Database SystemsYu-Shan Lin, Ching Tsai, Tz-Yu Lin, Yun-Sheng Chang 等SIGMOD 2021 · 被引用 17 次
相关 Paper
- Zeus: locality-aware distributed transactionsAntonios Katsarakis, Yijun Ma, Zhaowei Tan, Andrew Bainbridge 等EuroSys 2021 · 被引用 20 次
- Epoch-based Optimistic Concurrency Control in Geo-replicated DatabasesYunhao Mao, Harunari Takata, Michail Bachras, Yuqiu Zhang 等SIGMOD 2026
- Logos: Robust Sharding Blockchain With Fast Processing and Optimal Cross-Shard OverheadYizhong Liu, Boyu Zhao, Yuxuan Hu, Haojun Tan 等USENIX Security 2026
- DynaMast: Adaptive Dynamic Mastering for Replicated SystemsMichael Abebe, Brad Glasbergen, Khuzaima DaudjeeICDE 2020 · 被引用 14 次
- Handling Highly Contended OLTP Workloads Using Fast Dynamic PartitioningGuna Prasaad, Alvin Cheung, Dan SuciuSIGMOD 2020 · 被引用 34 次
