Towards an Optimal Data-Structure: CB-trees

Summary: Introduces chained B-trees (CB-trees), whose access-cost curve improves on B-trees while preserving space utilization and comparable construction cost. A novel in-core simulation evaluates their nonuniform page-fetch depths and cross-page nodes. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 7840
Venue: VLDB
Year: 1984
Pagerank: -
Overall Rank: 14,493 | 0.57%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. T. V. Prabhakar (Indian Institute of Technology Kanpur)
2. H. V. Sahasrabuddhe (Indian Institute of Technology Kanpur)

BibTeX Citation

@article{prabhakar_vldb84,
        title = {{Towards an Optimal Data-Structure: CB-trees}},
        author = {Prabhakar, T. V. and Sahasrabuddhe, H. V.},
        journal = {PVLDB},
        series = {{VLDB} '84},
        pages = {235},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,075	Distributing a Search Tree Among a Growing Number of Processors	1994	SIGMOD
2	1,663	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD
3	6,451	Efficient Search of Multidimensional B-Trees	1995	VLDB
4	10,149	Bounding the Fragmentation of B-Trees Subject to Batched Insertions	2026	PODS
5	5,120	Multi-Disk B-trees	1991	SIGMOD
6	14,479	An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees	1984	SIGMOD
7	6,246	Compact B-Trees	1979	SIGMOD
8	13,274	Experiments With B-Tree Reorganization	1980	SIGMOD
9	9,810	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD
10	1,112	Cache-Oblivious String B-trees	2006	PODS