Polaris: Enabling Transaction Priority in Optimistic Concurrency Control
Open Access
- 26 May 2023
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (1) , 1-24
Abstract
Transaction priority is a critical feature for real-world database systems. Under high contention, certain classes of transactions should be given a higher chance to commit than others. Such a prioritization mechanism is commonly implemented in locking-based concurrency control protocols as some lock scheduling mechanisms, but it is rarely supported in the world of optimistic concurrency control. We present Polaris, an optimistic concurrency control protocol that supports multiple priority levels. To enforce priority, Polaris introduces a minimal amount of pessimism through a lightweight reservation mechanism. The protocol is fully optimistic among transactions within the same priority level and preserves the high throughput advantage of optimistic protocols. Our evaluation with YCSB workload shows that Polaris can make the p999 tail latency of high-priority transactions 13x lower than that of low-priority ones. With an abort-aware priority assignment policy, Polaris can deliver 1.9x higher throughput and 17x lower tail latency compared to Silo for high-contention workloads.Keywords
Funding Information
- NSF (2144588)
This publication has 24 references indexed in Scilit:
- TicToc2016
- High-performance ACID via modular concurrency control2015
- FOEDUS2015
- Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems2015
- Speedy transactions in multicore in-memory databases2013
- The tail at scaleCommunications of the ACM, 2013
- Benchmarking cloud serving systems with YCSB2010
- Locking protocols for concurrency control in real-time database systemsACM SIGMOD Record, 1992
- Scheduling real-time transactionsACM Transactions on Database Systems, 1992
- Dynamic real-time optimistic concurrency control1990