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 (Northeastern University)
- 2. Betty Salzberg (Northeastern University)
BibTeX Citation
@inproceedings{zou_sigmod96,
title = {{On-line Reorganization of Sparsely-populated B+-trees}},
author = {Zou, Chendong and Salzberg, Betty},
series = {{SIGMOD} '96},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/233269.233325},
url = {https://dl.acm.org/doi/10.1145/233269.233325},
year = {1996}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,454 | Towards Self-Tuning Data Placement in Parallel Database Systems | 2000 | SIGMOD | 7.4001286e-05 |
| 4,784 | Locality preserving dictionaries: theory & application to clustering in databases | 1999 | PODS | 6.5088664e-05 |
| 4,839 | Safely and Efficiently Updating References During On-line Reorganization | 1998 | VLDB | 6.4838601e-05 |
| 7,804 | Online B-Tree Merging | 2005 | SIGMOD | 5.5415082e-05 |
| 7,944 | On-line Reorganization in Object Databases | 2000 | SIGMOD | 5.5181056e-05 |
| 9,103 | Online Index Rebuild | 2000 | SIGMOD | 5.3245321e-05 |
| 12,866 | Online Scaling in a Highly Available Database | 2001 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 214 | ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes | 1990 | VLDB | 0.00024680756 |
| 924 | Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates | 1992 | SIGMOD | 0.00013185068 |
| 3,114 | Access Method Concurrency with Recovery | 1992 | SIGMOD | 7.7405805e-05 |
| 5,104 | Redo Recovery after System Crashes | 1995 | VLDB | 6.3641018e-05 |
| 5,493 | Principles of Transaction-Based On-Line Reorganization | 1992 | VLDB | 6.1999067e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,458 | Random Sampling from Pseudo-Ranked B+ Trees | 1992 | VLDB |
| 2 | 6,246 | Compact B-Trees | 1979 | SIGMOD |
| 3 | 5,530 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |
| 4 | 464 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS |
| 5 | 5,120 | Multi-Disk B-trees | 1991 | SIGMOD |
| 6 | 11,218 | Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives | 2024 | VLDB |
| 7 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 8 | 13,274 | Experiments With B-Tree Reorganization | 1980 | SIGMOD |
| 9 | 13,036 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 10 | 7,804 | Online B-Tree Merging | 2005 | SIGMOD |