mlsanityData to 7 Oct 2026

Polyjuice: High-Performance Transactions via Learned Concurrency Control

arXiv 2105.10329 ↗First posted 21 May 2021cs.DBcited by 4

Not on the map. Why?

Abstract (arXiv)

Concurrency control algorithms are key determinants of the performance of in-memory databases. Existing algorithms are designed to work well for certain workloads. For example, optimistic concurrency control (OCC) is better than two-phase-locking (2PL) under low contention, while the converse is true under high contention. To adapt to different workloads, prior works mix or switch between a few known algorithms using manual insights or simple heuristics. We propose a learning-based framework that instead explicitly optimizes concurrency control via offline training to maximize performance. Instead of choosing among a small number of known algorithms, our approach searches in a "policy space" of fine-grained actions, resulting in novel algorithms that can outperform existing algorithms by specializing to a given workload. We build Polyjuice based on our learning framework and evaluate it against several existing algorithms. Under different configurations of TPC-C and TPC-E, Polyjuice can achieve throughput numbers higher than the best of existing algorithms by 15% to 56%.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 May 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 2; 2025: 0; 2026: 1.

4 papers.