An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees.
Aaron M. Tenenbaum
David M. Arnow
ACM SIGMOD Conference
1984
14
2
33
46
It is well-known that the B-tree data structure yields excellent worst-case search costs and for that reason is widely employed in the organization of external files and in the implementation of data bases. In this paper, we examine general B-trees empiri