AUGMENTATION OF B-TREE SEARCH OPERATION

B-tree, a well known tree data structure has arguably been one of the best data structure to use in database and filesystems. The traversal of Btree performs an inorder walk. This paper focuses on finding the i th element efficiently from a tree by defining a new attribute size and rank.The augmented function used here to find the i th element in a b-tree operates at O(log tn) complexity without violating the insertion and deletion algorithms. Here ‘t’ signifies the minimum degree of the tree.