Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    B+ Tree Example

    Uploaded by

    Sai keerthi Ambati

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    B+ Tree Example

    Uploaded by

    Sai keerthi Ambati
    11 views5 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    11 views5 pages

    B+ Tree Example

    Uploaded by

    Sai keerthi Ambati

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    Basis of

    Comparison B tree B+ tree

    Pointers All internal and leaf nodes have data pointers Only leaf nodes have data pointers

    Since all keys are not available at leaf, search often All keys are at leaf nodes, hence
    Search
    takes more time. search is faster and more accurate.

    Redundant Duplicate of keys are maintained and


    No duplicate of keys is maintained in the tree.
    Keys all nodes are present at the leaf.

    Insertion takes more time and it is not predictable Insertion is easier and the results are
    Insertion
    sometimes. always the same.

    Deletion of the internal node is very complex and Deletion of any node is easy because
    Deletion
    the tree has to undergo a lot of transformations. all node are found at leaf.

    Leaf nodes are stored as structural


    Leaf Nodes Leaf nodes are not stored as structural linked list.
    linked list.

    Sequential access is possible just like


    Access Sequential access to nodes is not possible
    linked list

    Height is lesser than B tree for the


    Height For a particular number nodes height is larger
    same number of nodes

    B+ Trees used in Multilevel Indexing,


    Application B-Trees used in Databases, Search engines
    Database indexing
    Example to illustrate insertion on a B+ tree

    Problem: Insert the following key values 6, 16, 26, 36, 46 on a B+ tree with order = 3.
    Solution:
    Step 1: The order is 3 so at maximum in a node so there can be only 2 search key values. As insertion
    happens on a leaf node only in a B+ tree so insert search key value 6 and 16 in increasing order in the -
    node. Below is the illustration of the same:
    Step 2: We cannot insert 26 in the same node as it causes an overflow in the leaf node, We have to split
    the leaf node according to the rules. First part contains ceil((3-1)/2) values i.e., only 6. The second node
    contains the remaining values i.e., 16 and 26. Then also copy the smallest search key value from the
    second node to the parent node i.e., 16 to the parent node. Below is the illustration of the same:

    Step 3: Now the next value is 36 that is to be inserted after 26 but in that node, it causes an overflow
    again in that leaf node. Again follow the above steps to split the node. First part
    contains ceil((3-1)/2) values i.e., only 16. The second node contains the remaining values i.e., 26 and 36.
    Then also copy the smallest search key value from the second node to the parent node i.e., 26 to the
    parent node. Below is the illustration of the same:
    The illustration is shown in the diagram below.
    Step 4: Now we have to insert 46 which is to be inserted after 36 but it causes an overflow in the leaf
    node. So we split the node according to the rules. The first part contains 26 and the second part
    contains 36 and 46 but now we also have to copy 36 to the parent node but it causes overflow as only
    two search key values can be accommodated in a node. Now follow the steps to deal with overflow in
    the non-leaf node.
    First node contains ceil(3/2)-1 values i.e. ’16’.
    Move the smallest among remaining to the parent i.e ’26’ will be the new parent node.
    The second node contains the remaining keys i.e ’36’ and the rest of the leaf nodes remain the same.
    Below is the illustration of the same:

    You might also like