A Survey of B-Tree Locking Techniques
GOETZ GRAEFE, 2010
Beginner
5.0
Concurrency control of operations in B-trees, however, is perceived as a difficult subject with many subtleties and special cases. The purpose of this survey is to clarify, simplify, and structure the topic of concurrency control in B-trees by dividing it into two subtopics and exploring each of them in depth.
Download PDF
Isolation Levels and MVCC in SQL Databases: A Technical Comparative Study
Franck Pachot, 2024
Beginner
5.0
This technical session explores the implementation of these concepts in popular SQL databases such as Oracle, MySQL, SQL Server, PostgreSQL, and YugabyteDB.
Watch Videos
Scalable and Robust Snapshot Isolation for High-Performance Storage Engines
Adnan Alhomssi and Viktor Leis, 2023
Intermediate
4.0
A study on scalable and robust snapshot isolation techniques for high-performance storage engines.
Download PDF
ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging
C. Mohan et al., 1992
Intermediate
5.0
A seminal paper on transaction recovery using write-ahead logging.
Download PDF
Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores
Xiangyao Yu et al., 2014
Intermediate
5.0
In particular, as the number of cores increases, the problem of concurrency control becomes extremely challenging. With hundreds of threads running in parallel, the complexity of coordinating competing accesses to data will likely diminish the gains from increased core counts.
Download PDF
Avoiding Scalability Collapse by Restricting Concurrency
Dave Dice et al., 2019
Intermediate
5.0
Saturated locks often degrade the performance of a multithreaded application, leading to a so-called scalability collapse problem.
Download PDF
Rethinking Logging, Checkpoints, and Recovery for High-Performance Storage Engines
Michael Haubenschild et al., 2020
Intermediate
5.0
In this work, we propose a new logging and recovery design that supports incremental and fuzzy checkpointing, index recovery, out-of-memory workloads, and low-latency transaction commits.
Download PDF
Improving Index Performance through Prefetching
Shimin Chen et al., 2001
Advanced
5.0
This paper proposes and evaluates Prefetching B+-Trees, which use prefetching to accelerate two important operations on B+-Tree indices: searches and range scans.
Download PDF
Rethink Data Anomalies In Databases
Haixiang Li et al., 2021
Advanced
5.0
A general framework called Coo with the capability to formally define all data anomalies and quantitatively describe them.
Download PDF