Scribd
Upload
2 views

B Tree.pptx

B-Trees are m-way trees optimized for disk access, allowing for efficient storage of large keys while maintaining a relatively small height. They support operations like searching, insertion, and deletion with a guaranteed time complexity of O(log n), making them suitable for large datasets. B-Trees are widely used in databases, indexing, and various applications including CAD systems and natural language processing.

Uploaded by

OML series
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

B Tree.pptx

B-Trees are m-way trees optimized for disk access, allowing for efficient storage of large keys while maintaining a relatively small height. They support operations like searching, insertion, and deletion with a guaranteed time complexity of O(log n), making them suitable for large datasets. B-Trees are widely used in databases, indexing, and various applications including CAD systems and natural language processing.

Uploaded by

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

B-Tree

Introduction
• B Tree is a specialized m-way tree that can be widely used for disk
access.
• A B-Tree of order m can have at most m-1 keys and m children.
• One of the main reason of using B tree is its capability to store
large number of keys in a single node and large key values by
keeping the height of the tree relatively small.
• A B tree of order m contains all the properties of an M way tree. In
addition, it contains the following properties.
1. Every node in a B-Tree contains at most m children.
2. Every node in a B-Tree except the root node and the leaf node contain
at least m/2 children.
3. The root nodes must have at least 2 nodes.
4. All leaf nodes must be at the same level.
• It is not necessary that, all the nodes contain the same number of
children but, each node must have m/2 number of nodes.
B Tree of order 4

• While performing some operations on B Tree, any property of B Tree may


violate such as number of minimum children a node can have. To maintain
the properties of B Tree, the tree may split or join.
Searching
• Searching in B Trees is similar to that in Binary
search tree. For example, if we search for an
item 49 in the following B Tree.
• The process will something like following :
1. Compare item 49 with root node 78. since 49 <
78 hence, move to its left sub-tree.
2. Since, 40<49<56, traverse right sub-tree of 40.
3. 49>45, move to right. Compare 49.
4. match found, return.
Searching
• Searching in a B tree depends upon the height
of the tree. The search algorithm takes O(log
n) time to search any element in a B tree.
Inserting
• Insertions are done at the leaf node level. The following algorithm needs
to be followed in order to insert an item into B Tree.
• Traverse the B Tree in order to find the appropriate leaf node at which the
node can be inserted.
• If the leaf node contain less than m-1 keys then insert the element in the
increasing order.
• Else, if the leaf node contains m-1 keys, then follow the following steps.
– Insert the new element in the increasing order of elements.
– Split the node into the two nodes at the median.
– Push the median element upto its parent node.
– If the parent node also contain m-1 number of keys, then split it too by
following the same steps.
Example
• Insert the node 8 into the B Tree of order 5
shown in the following image.
8 will be inserted to the right of 5, therefore insert 8
The node, now contain 5 keys which is greater than (5 -1 = 4 )
keys. Therefore split the node from the median i.e. 8 and push it
up to its parent node shown as follows.
Deletion
• Deletion is also performed at the leaf nodes. The node which is to be deleted can
either be a leaf node or an internal node. Following algorithm needs to be followed
in order to delete a node from a B tree.
1. Locate the leaf node.
2. If there are more than m/2 keys in the leaf node then delete the desired key from
the node.
3. If the leaf node doesn't contain m/2 keys then complete the keys by taking the
element from eight or left sibling.
– If the left sibling contains more than m/2 elements then push its largest
element up to its parent and move the intervening element down to the node
where the key is deleted.
– If the right sibling contains more than m/2 elements then push its smallest
element up to the parent and move intervening element down to the node
where the key is deleted.
•
Deletion
4. If neither of the sibling contain more than m/2 elements then create a
new leaf node by joining two leaf nodes and the intervening element of
the parent node.
5. If parent is left with less than m/2 nodes then, apply the above process on
the parent too.

• If the node which is to be deleted is an internal node, then replace the


node with its in-order successor or predecessor. Since, successor or
predecessor will always be on the leaf node hence, the process will be
similar as the node is being deleted from the leaf node.
Delete the node 53 from the B Tree of
order 5
53 is present in the right child of
element 49. Delete it
Now, 57 is the only element which is left in the node, the
minimum number of elements that must be present in a B tree
of order 5, is 2. it is less than that, the elements in its left and
right sub-tree are also not sufficient therefore, merge it with the
left sibling and intervening element of parent i.e. 49.
Disadvantages of B-Trees
• B-Trees are based on disk-based data
structures and can have a high disk usage.
• Not the best for all cases.
• Slow in comparison to other data structures.
Advantages of B-Trees
• B-Trees have a guaranteed time complexity of
O(log n) for basic operations like insertion,
deletion, and searching, which makes them
suitable for large data sets and real-time
applications.
• B-Trees are self-balancing.
• High-concurrency and high-throughput.
• Efficient storage utilization.
Applications of B-Trees
• It is used in large databases to access data stored on the disk
• Searching for data in a data set can be achieved in significantly
less time using the B-Tree
• With the indexing feature, multilevel indexing can be
achieved.
• Most of the servers also use the B-tree approach.
• B-Trees are used in CAD systems to organize and search
geometric data.
• B-Trees are also used in other areas such as natural language
processing, computer networks, and cryptography.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy