Online B-Tree Merging

Summary: Online B-tree merging of two indexes with the same key range; leaf-page merges piggyback on transactions, yielding single-index visibility. Forward-recoverable merging with logging ensures consistency and no lost work; experiments show IO savings. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3647
Venue: SIGMOD
Year: 2005
Pagerank: 4.8030945e-05
Overall Rank: 7,200 | 49.92%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,558	Rose: Compressed, log-structured replication	2008	VLDB	8.5455497e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
174	ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes	1990	VLDB	0.00038347904
823	Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method	1998	VLDB	0.000162378
875	Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates	1992	SIGMOD	0.00015719411
1,077	Incremental Organization for Data Recording and Warehousing	1997	VLDB	0.00014247204
1,088	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD	0.00014161003
1,524	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00011516282
1,982	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	9.8662834e-05
3,244	Access Method Concurrency with Recovery	1992	SIGMOD	7.3262881e-05
3,401	Towards Self-Tuning Data Placement in Parallel Database Systems	2000	SIGMOD	7.1400085e-05
3,428	Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases	1996	SIGMOD	7.1029689e-05
4,878	Safely and Efficiently Updating References During On-line Reorganization	1998	VLDB	5.858048e-05
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6106291e-05
8,860	Online Index Rebuild	2000	SIGMOD	4.4342209e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,244	Access Method Concurrency with Recovery	1992	SIGMOD	7.3262881e-05
1,774	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010604097
6,250	Operation Specific Locking In B-Trees	1987	PODS	5.1383127e-05
8,049	Contention and Space Management in B-Trees	2021	CIDR	4.5973972e-05
8,860	Online Index Rebuild	2000	SIGMOD	4.4342209e-05
12,843	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB	4.1945683e-05
1,524	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00011516282
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6106291e-05
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011295081
1,982	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	9.8662834e-05