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: 3648
Venue: SIGMOD
Year: 2005
Pagerank: 4.7984795e-05
Overall Rank: 7,199 | 49.97%
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,562	Rose: Compressed, log-structured replication	2008	VLDB	8.5373135e-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
175	ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes	1990	VLDB	0.00038354115
820	Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method	1998	VLDB	0.00016232743
871	Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates	1992	SIGMOD	0.00015708561
1,071	Incremental Organization for Data Recording and Warehousing	1997	VLDB	0.00014265647
1,087	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD	0.00014159274
1,524	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00011509464
1,986	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	9.8572036e-05
3,251	Access Method Concurrency with Recovery	1992	SIGMOD	7.3198815e-05
3,400	Towards Self-Tuning Data Placement in Parallel Database Systems	2000	SIGMOD	7.1346268e-05
3,433	Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases	1996	SIGMOD	7.0966926e-05
4,881	Safely and Efficiently Updating References During On-line Reorganization	1998	VLDB	5.8525783e-05
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6060584e-05
8,860	Online Index Rebuild	2000	SIGMOD	4.4299696e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,251	Access Method Concurrency with Recovery	1992	SIGMOD	7.3198815e-05
1,766	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010611043
6,244	Operation Specific Locking In B-Trees	1987	PODS	5.1342001e-05
8,032	Contention and Space Management in B-Trees	2021	CIDR	4.5983032e-05
8,860	Online Index Rebuild	2000	SIGMOD	4.4299696e-05
12,852	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB	4.1905499e-05
1,524	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00011509464
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6060584e-05
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011293832
1,986	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	9.8572036e-05