Write-Optimized B-Trees

Summary: Write-optimized B-trees support large, mixed in-place and log-structured writes for internal nodes and leaves. Inexpensive page migration enables defragmentation and consolidation while preserving ACID, fine-grained locking, and fast search with no indirection. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9175
Venue: VLDB
Year: 2004
Pagerank: 0.00011727205
Overall Rank: 1,478 | 89.73%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Goetz Graefe

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
347	Design of Flash-Based DBMS: An In-Page Logging Approach	2007	SIGMOD	0.0002656744
562	Tree Indexing on Solid State Drives	2010	VLDB	0.00020035385
2,838	Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases	2015	SIGMOD	8.0428751e-05
4,268	Fast General Distributed Transactions with Opacity	2019	SIGMOD	6.2976914e-05
5,286	Optimistic Concurrency Control by Melding Trees	2011	VLDB	5.5809166e-05
6,839	Minuet: A Scalable Distributed Multiversion B-Tree	2012	VLDB	4.9060482e-05
7,990	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	4.6086117e-05
8,795	Resource-Adaptive Query Execution with Paged Memory Management	2025	CIDR	4.4446768e-05
9,320	Definition, Detection, and Recovery of Single-Page Failures, a Fourth Class of Database Failures	2012	VLDB	4.3521803e-05
10,255	How to Write to SSDs	2026	VLDB	4.1905499e-05
10,729	Enhancing Transaction Processing through Indirection Skipping	2025	VLDB	4.1905499e-05
11,772	Write-Optimized Skip Lists	2017	PODS	4.1905499e-05
12,080	NoFTL: Database Systems on FTL-less Flash Storage	2013	VLDB	4.1905499e-05

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
32	Differential Files: Their Application To The Maintenance Of Large Data Bases	1976	SIGMOD	0.00077553033
50	A Case for Redundant Arrays of Inexpensive Disks (RAID)	1988	SIGMOD	0.00067287977
175	ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes	1990	VLDB	0.00038354115
1,415	Data Compression in Oracle	2003	VLDB	0.00012102269
1,501	Key Range Locking Strategies for Improved Concurrency	1993	VLDB	0.00011621226
1,524	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00011509464
1,659	Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance	2002	SIGMOD	0.00010970279
2,847	Utilization of B-trees with Inserts, Deletes and Modifies	1989	PODS	8.0287397e-05
3,774	Write-Only Disk Caches	1990	SIGMOD	6.7729038e-05
7,020	Transaction Support in Read Optimized and Write Optimized File Systems	1990	VLDB	4.8548738e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
12,852	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB	4.1905499e-05
7,990	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	4.6086117e-05
11,709	Splaying Log-Structured Merge-Trees	2018	SIGMOD	4.1905499e-05
1,988	A Practical Scalable Distributed B-Tree	2008	VLDB	9.8500023e-05
809	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB	0.00016409797
1,986	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	9.8572036e-05
7,152	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB	4.8126591e-05
11,010	Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives	2024	VLDB	4.1905499e-05
10,380	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD	4.1905499e-05
5,217	Multi-Disk B-trees	1991	SIGMOD	5.621547e-05