Experiments With B-Tree Reorganization
Summary: Explicit B-tree reorganization to defer root splits is proposed, challenging the view that dynamic balancing suffices. A tunable storage-utilization reorganization algorithm is evaluated with simulations, demonstrating economic feasibility under targeted workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ehud Gudes
- 2. Shalom Tsur
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,317 | Compact B-Trees | 1979 | SIGMOD | 6.2824978e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,669 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD | 6.0039237e-05 |
| 639 | On B-tree Indices for Skewed Distributions | 1992 | VLDB | 0.00018782897 |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
| 1,524 | Sorting And Indexing With Partitioned B-Trees | 2003 | CIDR | 0.00011509464 |
| 5,217 | Multi-Disk B-trees | 1991 | SIGMOD | 5.621547e-05 |
| 14,306 | Towards an Optimal Data-Structure: CB-trees | 1984 | VLDB | - |
| 14,292 | An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees | 1984 | SIGMOD | - |
| 9,410 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3399748e-05 |
| 1,986 | On-line Reorganization of Sparsely-populated B+-trees | 1996 | SIGMOD | 9.8572036e-05 |
| 2,847 | Utilization of B-trees with Inserts, Deletes and Modifies | 1989 | PODS | 8.0287397e-05 |