Lecture 31. 



I picked up from where I left off last Friday morning, with a more detailed description of the technique for handling an overflow in a 2-4 tree. I then proceeded to a description of how to implement deletions in a 2-4 tree.

As was mentioned on Friday there are two distinct uses for the multi-way search tree organization, one for small branches as in 2-4 trees, and the other when the branching factor is large. That is the topic of the attached presentation. This explains how the so called B-tree and B+-tree are used to minimize external memory accesses.

BandB.pdf  

Posted: Mon - March 26, 2007 at 12:18 PM          

©