B Sharp Tree

From Wikipedia, the free encyclopedia

B# Tree (pronounced B Sharp Tree) is similar to a B+ tree with rotations allowed among brothers only (immediate siblings).

Insertion Procedure:

Find the node where the new key is to be inserted. If that node is full we must try to perform a rotation with one of our brothers. If all of our brothers are at capacity we must split the node as we do in a B+ Tree.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../b/_/s/B_Sharp_Tree_1647.html"