Posted by admin | Posted in trees,shrubs | Posted on 14-09-2010
Tags: algorithm, algorithms, b+ trees dbms, b+ trees dbms ppts, b-tree, programming, tree
Why a B plus tree is a better tree structure than a B tree for implementation of an indexed sequential file?
DBMS
In a B+ tree, in contrast to a B-tree, all records are stored at the leaf level of the tree; only keys are stored in interior nodes. To understand why this is more efficient, you have to understand how trees are used.