Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases
Summary: First full Hyder-style, non-partitioned scalable DB using optimistic CC on a multi-versioned tree-structured store in a shared log. Meld, the log-rollforward OC core, is parallelized via a pipelined, multi-threaded design, delivering 3x throughput over the original. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Philip A. Bernstein (Microsoft)
- 2. Sudipto Das (Microsoft)
- 3. Bailu Ding (Cornell University)
- 4. Markus Pilman (ETH Zurich)
BibTeX Citation
@inproceedings{bernstein_sigmod15,
title = {{Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases}},
author = {Bernstein, Philip A. and Das, Sudipto and Ding, Bailu and Pilman, Markus},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2723788},
url = {https://dl.acm.org/doi/10.1145/2723372.2723788},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 54 | Calvin: Fast Distributed Transactions for Partitioned Database Systems | 2012 | SIGMOD | 0.00040489652 |
| 172 | High-Performance Concurrency Control Mechanisms for Main-Memory Databases | 2012 | VLDB | 0.00027021768 |
| 261 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.00022862412 |
| 365 | Hyder - A Transactional Record Manager for Shared Flash | 2011 | CIDR | 0.00019904414 |
| 503 | Design of Flash-Based DBMS: An In-Page Logging Approach | 2007 | SIGMOD | 0.00017231771 |
| 1,770 | Write-Optimized B-Trees | 2004 | VLDB | 9.6795618e-05 |
| 2,028 | A Practical Scalable Distributed B-Tree | 2008 | VLDB | 9.1500243e-05 |
| 2,071 | Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks | 1995 | SIGMOD | 9.0668566e-05 |
| 4,950 | Optimistic Concurrency Control by Melding Trees | 2011 | VLDB | 6.3271298e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 172 | High-Performance Concurrency Control Mechanisms for Main-Memory Databases | 2012 | VLDB |
| 2 | 11,351 | Concurrency Control as a Service | 2025 | VLDB |
| 3 | 365 | Hyder - A Transactional Record Manager for Shared Flash | 2011 | CIDR |
| 4 | 6,424 | Adaptive Optimistic Concurrency Control for Heterogeneous Workloads | 2019 | VLDB |
| 5 | 4,081 | Transaction Healing: Scaling Optimistic Concurrency Control on Multicores | 2016 | SIGMOD |
| 6 | 6,740 | Memory-Optimized Multi-Version Concurrency Control for Disk-Based Database Systems | 2022 | VLDB |
| 7 | 2,071 | Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks | 1995 | SIGMOD |
| 8 | 1,585 | On the Design and Scalability of Distributed Shared-Data Databases | 2015 | SIGMOD |
| 9 | 797 | Low Overhead Concurrency Control for Partitioned Main Memory Databases | 2010 | SIGMOD |
| 10 | 4,950 | Optimistic Concurrency Control by Melding Trees | 2011 | VLDB |