Compact B-Trees
Summary: Compact B-trees are minimal-node B-trees among equally capacious trees of the same order, achieving optimal space utilization. Shows up to 2.5x space savings over visit-optimal B-trees, with node-visit cost at most 1 more than optimal; gives a linear-time, in-place compactification algorithm. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,086 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
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 |
| 13,086 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 4.1905499e-05 |
| 8,770 | Compact O-Complete Trees | 1988 | VLDB | 4.4520434e-05 |
| 6,473 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0427056e-05 |
| 14,306 | Towards an Optimal Data-Structure: CB-trees | 1984 | VLDB | - |
| 12,852 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1905499e-05 |
| 14,362 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD | - |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
| 9,410 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3399748e-05 |
| 14,292 | An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees | 1984 | SIGMOD | - |