On-line Reorganization of Sparsely-populated B+-trees
Summary: Online reorg of sparsely-populated B+-trees, leaves-first leaf-group compaction with key-order preservation. Adds minimal-page locking concurrency, Forward Recovery for crash-consistency, and a swap-reduction heuristic; switch-over to a B+-tree. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chendong Zou
- 2. Betty Salzberg
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,400 | Towards Self-Tuning Data Placement in Parallel Database Systems | 2000 | SIGMOD | 7.1346268e-05 |
| 4,045 | Locality preserving dictionaries: theory & application to clustering in databases | 1999 | PODS | 6.5027644e-05 |
| 4,881 | Safely and Efficiently Updating References During On-line Reorganization | 1998 | VLDB | 5.8525783e-05 |
| 7,199 | Online B-Tree Merging | 2005 | SIGMOD | 4.7984795e-05 |
| 7,523 | On-line Reorganization in Object Databases | 2000 | SIGMOD | 4.7135369e-05 |
| 8,860 | Online Index Rebuild | 2000 | SIGMOD | 4.4299696e-05 |
| 12,682 | Online Scaling in a Highly Available Database | 2001 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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 |
| 871 | Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates | 1992 | SIGMOD | 0.00015708561 |
| 3,251 | Access Method Concurrency with Recovery | 1992 | SIGMOD | 7.3198815e-05 |
| 4,231 | Redo Recovery after System Crashes | 1995 | VLDB | 6.3328497e-05 |
| 5,364 | Principles of Transaction-Based On-Line Reorganization | 1992 | VLDB | 5.5466304e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,965 | Random Sampling from Pseudo-Ranked B+ Trees | 1992 | VLDB | 6.5786424e-05 |
| 4,317 | Compact B-Trees | 1979 | SIGMOD | 6.2824978e-05 |
| 5,239 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 5.6060584e-05 |
| 282 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.00029054939 |
| 5,217 | Multi-Disk B-trees | 1991 | SIGMOD | 5.621547e-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 |
| 13,086 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 4.1905499e-05 |
| 12,852 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1905499e-05 |
| 7,199 | Online B-Tree Merging | 2005 | SIGMOD | 4.7984795e-05 |