Difference between B and B+ tree in database

B tree indices are similar to B+ tree indices. The primary distinction between the two approaches is that a B-tree eliminates the redundant storage of search key values. Search keys are not repeated in B tree indices.
Given below the major difference between B tree and B+ tree structure.

1. In a B tree search keys and data stored in internal or leaf nodes. But in B+-tree data store only leaf nodes.
2. Searching of any data in a B+ tree is very easy because all data are found in leaf nodes otherwise in a B tree data cannot found in leaf node.
3. In B tree data may found leaf or non leaf node. Deletion of non leaf node is very complicated. Otherwise in a B+ tree data must found leaf node. So deletion is easy in leaf node.  
4. Insertion of a B tree is more complicated than B+ tree. 
    5.  B +tree store redundant search key but b-tree has no redundant value.
    6. In B+ tree leaf node data are ordered in a sequential linked list but in B tree the leaf node cannot stored using linked list.
Many database system implementers prefer the structural simplicity of a b+ tree.

Comments

Popular posts from this blog

How to construct a B+ tree with example

How to show only month and year fields in android Date-picker?

Visitor Counter Script Using PHP