DBScholar

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
2294
Venue
SIGMOD
Year
1984
Pagerank
-
Overall Rank
14,479 | 0.67%
DOI
10.1145/602259.602265

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{arnow_sigmod84,
        title = {{An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees}},
        author = {Arnow, David M. and Tenenbaum, Aaron M.},
        series = {{SIGMOD} '84},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/602259.602265},
        url = {https://dl.acm.org/doi/10.1145/602259.602265},
        year = {1984}
}

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