Proceedings of the VLDB Endowment · 2016 · 62 citations · 16 references
ComputingComputer ScienceComputer SystemsDatabasesDistributed SystemsOperating SystemsConcurrency ControlQuery OptimizationQuery ProcessingTransaction ManagementApplication Performance AssessmentApplication Performance OptimizationContention ManagementLockingLocking MechanismsThroughputTransaction ProcessingTransaction Throughput Optimization
Locking is one of the predominant costs in transaction processing. While much work has focused on designing efficient concurrency control mechanisms, not much has been done on understanding how transaction applications issue queries and leveraging application semantics to improve application performance. This paper presents Q uro , a query-aware compiler that automatically reorders queries in transaction code to improve performance. Observing that certain queries within a transaction are more contentious than others as they require locking the same tuples as other concurrently executing transactions, Q uro automatically changes the application such that contentious queries are issued as late as possible. We have evaluated Q uro on various transaction benchmarks, and our results show that Q uro -generated implementations can increase transaction throughput by up to 6.53x, while reduce transaction latency by up to 85%.
16
OLTP through the looking glass, and what we found there
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madden et al. · 2008 · 302 citations
Xiangyao Yu, George Bezerra, Andrew Pavlo et al. · Proceedings of the VLDB Endowment · 2014 · 257 citations · Full text
Ryan Johnson, Ippokratis Pandis, Nikos Hardavellas et al. · 2009 · 215 citations · Full text