Scribd
Upload
59 views19 pages

B+ Tree

B+ trees are a type of balanced binary search tree used for implementing database indexes, where data records are stored only in leaf nodes and internal nodes contain keys. They offer advantages such as efficient searching and support for both random and sequential access, but come with disadvantages like space overhead and extra insertion of non-leaf nodes. The document also includes examples of insertion and deletion operations in B+ trees.

Uploaded by

Umaa Mageshwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
59 views19 pages

B+ Tree

B+ trees are a type of balanced binary search tree used for implementing database indexes, where data records are stored only in leaf nodes and internal nodes contain keys. They offer advantages such as efficient searching and support for both random and sequential access, but come with disadvantages like space overhead and extra insertion of non-leaf nodes. The document also includes examples of insertion and deletion operations in B+ trees.

Uploaded by

Umaa Mageshwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

B+ TREE

IN FILE
ORGANISATION
B+ TREE

 B+ tree are used to implement database index.


 It is a balanced binary search tree it's follows a
multilevel index format.
 In B+ tree lead nodes denotes actual data pointers.
 All leaf nodes removes at same height.
 The leaf node are linked using linked list.
 B+ tree occupy a little more space
CHARACTERISTIC

 Data records are only stored in leaf nodes.


 Internal nodes stores just keys only
OPERATION:

INSERTION
DELETION
INSERTION-EXAMPLE

Construct B+ tree for following


data. 30,31,23,32,22,28,24,29,
where number of pointers that fit in
one node are 5.
DELETION-EXAMPLE

Construct B+ Tree for the following set of key


values (2,3,5,7,11,17,19,23,29,31) Assume
that the tree is initially empty and values are
added in ascending order. Construct B+ tree
for the cases where the number of pointers
that fit one node is four. After creation of B+
tree perform following series of operations :
(a) Insert 9. (b) Insert 10. (c) Insert 8. (d)
Delete 23. (e) Delete 19
ADVANTAGES

 In B+ tree the data is stored in leaf node so


searching of any data requires scanning only
of leaf node alone.
 Data is ordered in linked list.
 Supports both random and sequential
access.
DISADVANTAGE

 Extra insertion of non leaf nodes.


 There is space overhead
THANK YOU!!!

You might also like