Skip to main content

What Is B-tree

                                     B-tree

What is B-tree ? 
  • B-tree : A b-tree is a self-balancing Tree data Structure  . it maintains sorted data and allows searches , Sequential access , insertion and deletion in O( log n ) Time .




b tree,b-tree,btree,tree,b+ tree,b tree tutorial,b trees,binary tree,balanced tree,data structure,b tree index,b tree delete,b tree search,b tree example,b tree deletion,b tree of order 3,b tree insertion,deletion in b tree,b tree definition,b tree in database,trees,btree vs b+tree,in tree,insertion in b tree,how to create b tree,b+ trees,b tree index in oracle,b tree nptel reference

  • Properties Of B-tree : A B-tree of order M is a tree which satisfied the following properties 
                        1) Every Node At most M children
                        2) Every non-leaf node has at least ⌈M/2⌉Child nodes .
                        3) The root has at least two children if it is not a leaf node .
                        4) A non-leaf node with k children contains k-1 keys .
                        5) All leaves appear in the same level .
  • Time Complexity Of B-tree : Insertion , deletion and searching all operation are worst case time complexity is O(log n) .
  • Space Complexity Of B-tree : worst case is  O(n) .
  • Advantage Of B-tree :
                            1) Keeps keys in sorted order for sequential traversing .
                            2) uses a hirarchical index to minimize the number of disk read
                            3) uses partially full blocks to speed insertion and deletion .
                            4) keeps the index balanced with recursive algorithm .
             
Labels:

Comments

Post a Comment