Write-Optimized B-Trees
Summary: Augments conventional B-trees with optional log-structured, large-write behavior while retaining in-place updates, direct node addressing, fine-grained locking, and ACID transactions. Inexpensive online page migration also supports defragmentation, free-space consolidation, compression, and range locking. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Goetz Graefe (Microsoft)
BibTeX Citation
@article{graefe_vldb04,
title = {{Write-Optimized B-Trees}},
author = {Graefe, Goetz},
journal = {PVLDB},
series = {{VLDB} '04},
pages = {672--683},
doi = {10.1016/B978-012088469-8.50060-7},
url = {https://doi.org/10.1016/B978-012088469-8.50060-7},
year = {2004}
}
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 59 | Differential Files: Their Application To The Maintenance Of Large Data Bases | 1976 | SIGMOD | 0.00040060625 |
| 133 | A Case for Redundant Arrays of Inexpensive Disks (RAID) | 1988 | SIGMOD | 0.00030370315 |
| 214 | ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes | 1990 | VLDB | 0.00024680756 |
| 1,222 | Data Compression in Oracle | 2003 | VLDB | 0.00011602327 |
| 1,501 | Key Range Locking Strategies for Improved Concurrency | 1993 | VLDB | 0.00010559899 |
| 1,508 | Sorting And Indexing With Partitioned B-Trees | 2003 | CIDR | 0.00010540965 |
| 1,567 | Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance | 2002 | SIGMOD | 0.00010343873 |
| 2,738 | Utilization of B-trees with Inserts, Deletes and Modifies | 1989 | PODS | 8.1875737e-05 |
| 3,938 | Write-Only Disk Caches | 1990 | SIGMOD | 7.0081626e-05 |
| 7,790 | Transaction Support in Read Optimized and Write Optimized File Systems | 1990 | VLDB | 5.5440082e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,036 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 2 | 7,189 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 3 | 11,908 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD |
| 4 | 2,001 | A Practical Scalable Distributed B-Tree | 2008 | VLDB |
| 5 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 6 | 2,968 | On-line Reorganization of Sparsely-populated B+-trees | 1996 | SIGMOD |
| 7 | 6,742 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 8 | 11,218 | Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives | 2024 | VLDB |
| 9 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 10 | 5,120 | Multi-Disk B-trees | 1991 | SIGMOD |