Towards Optimal Transaction Scheduling

Audrey Cheng

doi:10.14778/3681954.3681956

Towards Optimal Transaction Scheduling

2024-08-30

0

PRE

AI

DOI：10.14778/3681954.3681956

Original

Original request for help

Save

Abstract

En 中文

Maximizing transaction throughput is key to high-performance database systems, which focus on minimizing data access conflicts to improve performance. However, finding efficient schedules that reduce conflicts remains an open problem. For efficiency, previous scheduling techniques consider only a small subset of possible schedules. In this work, we propose systematically exploring the entire schedule space, proactively identifying efficient schedules, and executing them precisely during execution to improve throughput. We introduce a greedy scheduling policy, SMF, that efficiently finds fast schedules and outperforms state-of-the-art search techniques. To realize the benefits of these schedules in practice, we develop a schedule-first concurrency control protocol, MVSchedO, that enforces fine-grained operation orders. We implement both in our system R-SMF, a modified version of RocksDB, to achieve up to a 3.9x increase in throughput and 3.2x reduction in tail latency on a range of benchmarks and real-world workloads.

Keywords:

GENETIC ALGORITHMS

TUTORIAL SURVEY

TABU SEARCH

JOB

OPTIMIZATION

CONTENTION

Towards Optimal Transaction Scheduling

Abstract

Journal

Organization