Scalable and robust latches for database systems

Böttcher J, Leis V, Giceva J, Neumann T, Kemper A (2020)


Publication Type: Conference contribution

Publication year: 2020

Publisher: Association for Computing Machinery

Conference Proceedings Title: Proceedings of the 16th International Workshop on Data Management on New Hardware, DaMoN 2020

Event location: Portland, OR US

ISBN: 9781450380249

DOI: 10.1145/3399666.3399908

Abstract

Multi-core scalability is one of the most important features for database systems running on today's hardware. Not surprisingly, the implementation of locks is paramount to achieving efficient and scalable synchronization. In this work, we identify the key database-specific requirements for lock implementations and evaluate them using both micro-benchmarks and full-fledged database workloads. The results indicate that optimistic locking has superior performance in most workloads due to its minimal overhead and latency. By complementing optimistic locking with a pessimistic shared mode lock we demonstrate that we can also process HTAP workloads efficiently. Finally, we show how lock contention can be handled gracefully without slowing down the uncontented fast path or increasing space requirements by using a lightweight parking lot infrastructure.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Böttcher, J., Leis, V., Giceva, J., Neumann, T., & Kemper, A. (2020). Scalable and robust latches for database systems. In Proceedings of the 16th International Workshop on Data Management on New Hardware, DaMoN 2020. Portland, OR, US: Association for Computing Machinery.

MLA:

Böttcher, Jan, et al. "Scalable and robust latches for database systems." Proceedings of the 16th International Workshop on Data Management on New Hardware, DaMoN 2020, Portland, OR Association for Computing Machinery, 2020.

BibTeX: Download