B-tree and B+-tree

15 May 2012

B-tree is suitable for find, insert and delete operations, but terrible for next operation (sequential processing).

B+-tree, however, is a variant of B-tree, performs well not only on find, insert and delete operations, but also on sequential processing. This is due to the fact that B+-tree stores all the keys in the leaves and the entire upper levels are used for indexing (organized as B-tree) those keys in the leaves.