The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Height-balanced trees of order (β, γ, δ)
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
ACM Computing Surveys (CSUR)
P-trees: storage efficient multiway trees
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
B-trees of order m are a “balanced” class of m-ary trees, which have applications in the areas of file organization. In fact, they have been the only choice when balanced multiway trees are required. Although they have very simple insertion and deletion algorithms, their storage utilization, that is, the number of keys per page or node, is at worst 50 percent. In the present paper we investigate a new class of balanced m-ary trees, the dense multiway trees, and compare their storage utilization with that of B-trees of order m.Surprisingly, we are able to demonstrate that weakly dense multiway trees have an &Ogr;(log2 N) insertion algorithm. We also show that inserting mh - 1 keys in ascending order into an initially empty dense multiway tree yields the complete m-ary tree of height h, and that at intermediate steps in the insertion sequence the intermediate trees can also be considered to be as dense as possible. Furthermore, an analysis of the limiting dynamic behavior of the dense m-ary trees under insertion shows that the average storage utilization tends to 1; that is, the trees become as dense as possible. This motivates the use of the term “dense.”