Towards an Optimal Data-Structure: CB-trees
Summary: Proposes CB-trees, a chained B-tree variant with a superior access-cost curve and equal space utilisation/build cost to B-trees. Evaluates large random CB-trees via a novel in-core simulator; multi-page nodes yield non-uniform leaf fetch distances, vs. other B-tree variants. (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
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 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 |
|---|---|---|---|---|
| 3,806 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD | 6.7461245e-05 |
| 9,410 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3399748e-05 |
| 1,573 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00011293832 |
| 6,473 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0427056e-05 |
| 5,217 | Multi-Disk B-trees | 1991 | SIGMOD | 5.621547e-05 |
| 14,292 | An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees | 1984 | SIGMOD | - |
| 4,317 | Compact B-Trees | 1979 | SIGMOD | 6.2824978e-05 |
| 13,086 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 4.1905499e-05 |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
| 1,113 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00013885755 |