Algorithms & data structures
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Use of tree structures for processing files
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
Inductive benchmarking for purely functional data structures
Journal of Functional Programming
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
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 empirically and compare them with a less restrictive structure, the general multiway tree, and a more restrictive structure, the compact B-tree. We compare search costs, insertion costs, and space costs of these three structures for both small and large orders and indicate their relative utility for large and small data sets. Although there are cases when general multiway trees are more effective than B-trees, this is not the case for most practical situations. Compact B-trees are also shown to degrade rapidly in the presence of insertions and are therefore only useful for static data sets.