Database Paper Browser

Back to papers

An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees

Summary: Empirical performance comparison of B-trees, compact B-trees and multiway trees across small and large orders, evaluating search, insertion, and space costs. Results: multiway trees seldom beat B-trees in practice; compact B-trees degrade with insertions and suit static data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2232
Venue
SIGMOD
Year
1984
Pagerank
-
Overall Rank
14,278 | 0.67%
DOI
-

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
5 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0018397217
8,773 Compact O-Complete Trees 1988 VLDB 4.456315e-05
13,812 Relaxed Multi-Way Trees with Group Updates 2001 PODS -
14,292 Towards an Optimal Data-Structure: CB-trees 1984 VLDB -
10,368 B-Trees Are Back: Engineering Fast and Pageable Node Layouts 2025 SIGMOD 4.1945683e-05
13,073 Experiments With B-Tree Reorganization 1980 SIGMOD 4.1945683e-05
14,348 Multi-Table Search For B-Tree Files 1979 SIGMOD -
6,480 Efficient Search of Multidimensional B-Trees 1995 VLDB 5.0475112e-05
9,404 Revisiting B-tree Compression: An Experimental Study 2024 SIGMOD 4.3441378e-05
4,324 Compact B-Trees 1979 SIGMOD 6.2885419e-05