UNIT-III
B+ Tree
Dr. SK. YAKOOB
Associate Professor
B+ Tree
B+ Tree is an extension of B Tree which allows efficient
insertion, deletion and search operations.
In B Tree, Keys and records both can be stored in the
internal as well as leaf nodes. Whereas, in B+ tree,
records (data) can only be stored on the leaf nodes
while internal nodes can only store the key values.
The leaf nodes of a B+ tree are linked together in the form of a
singly linked lists to make the search queries more efficient.
B+ Tree are used to store the large amount of data which can not
be stored in the main memory.
Due to the fact that, size of main memory is always limited, the
internal nodes (keys to access records) of the B+ tree are stored
in the main memory whereas, leaf nodes are stored in the
secondary memory.
B+ Tree
The internal nodes of B+ tree are often called index nodes.
A B+ tree of order 3 is shown in the following figure.
B+ Tree
Advantages of B+ Tree
– Records can be fetched in equal number of disk accesses.
– Height of the tree remains balanced and less as compare to B tree.
– We can access the data stored in a B+ tree sequentially as well as
directly.
– Keys are used for indexing.
– Faster search queries as the data is stored only on the leaf nodes.
B+ Tree
• B Tree VS B+ Tree
SNO B Tree B+ Tree
1 Search keys can not be repeatedly stored. Redundant search keys can be present.
2 Data can be stored in leaf nodes as well as Data can only be stored on the leaf
internal nodes nodes.
3 Searching for some data is a slower process Searching is comparatively faster as data
since data can be found on internal nodes can only be found on the leaf nodes.
as well as on the leaf nodes.
4 Deletion of internal nodes are so Deletion will never be a complexed
complicated and time consuming. process since element will always be
deleted from the leaf nodes.
5 Leaf nodes can not be linked together. Leaf nodes are linked together to make
the search operations more efficient.
B+ Tree Operations
We perform following operations
1. Search
2. Insertion
3. Deletion
B+ Tree
Insertion Operation:
Step 1: Insert the new node as a leaf node
Step 2: If the leaf doesn't have required space, split the node and copy
the
middle node to the next index node.
Step 3: If the index node doesn't have required space, split the node and
copy
the middle element to the next index page.
Construct B+Tree of order 5:
• Insert the value 195 into the B+ tree of order 5 shown in the following figure.
B+ Tree
• 195 will be inserted in the right sub-tree of 120 after 190. Insert it at the desired position.
• Now, the index node contains 6 children and 5 keys which violates the B+ tree properties, therefore we need to split it.
B+ Tree
Construct B+Tree of order 5:
B+ Tree
Deletion Operation:
Step 1: Delete the key and data from the leaves.
Step 2: if the leaf node contains less than minimum number of elements,
merge
down the node with its sibling and delete the key in between
them.
Step 3: if the index node contains less than minimum number of
elements,
merge the node with the sibling and move down the key in
between them.
Deletion Operation:
Delete the key 200 from the B+ Tree shown in the following figure.
B+ Tree
200 is present in the right sub-tree of 190, after 195. delete it.
Deletion Operation:
Merge the two nodes by using 195, 190, 154 and 129.
B+ Tree
Now, element 120 is the single element present in the node which is violating the B+ Tree properties. Therefore, we need to merge it by using 60, 78, 108 and 120.
Thank you
