Explain insertion procedure into a b-tree, Data Structure & Algorithms

Ans:

Insertion into the B-tree:

1.  First search is made for the place where the new record must be positioned. As soon as the keys are inserted, they are sorted into the appropriate order.

2.  If the node can contain the new record, insert the new record at the suitable pointer so that number of pointers happens to be one more than the number of records.

3.  If the node overflows because of an upper bound on the size of the node, splitting is needed. The node is divided into three parts; the middle record is passed up and inserted into parent, leaving two children at the back. If n is odd (n-1 keys in full node and the new target key), the median key int(n/2)+1 is placed into the parent node, the lower n/2 keys are placed in the left leaf and the higher n/2 keys are placed in the right leaf. If n is even, we may have left biased or right biased means one key can be more in left child or right child respectively.

4.  Splitting may propagate up the tree because the parent, into which the divided record is added, it may overflow then it may be split.  If the root is required to be divided, a new record is created with only two children.

 

 

Posted Date: 7/11/2012 1:42:52 AM | Location : United States







Related Discussions:- Explain insertion procedure into a b-tree, Assignment Help, Ask Question on Explain insertion procedure into a b-tree, Get Answer, Expert's Help, Explain insertion procedure into a b-tree Discussions

Write discussion on Explain insertion procedure into a b-tree
Your posts are moderated
Related Questions
Which sorting methods would be most suitable for sorting a list which is almost sorted  Bubble Sorting method.

Implementation of Stack :- Stacks can be executed in the 2 ways: a)  Arrays b)  Linked List

Given the following search tree, state the order in which the nodes will be searched for breadth first, depth first, hill climbing and best first search, until a solution is reache

Before programming a problem solution those employees a stack, we have to decide how to represent a stack by using the data structures which exist in our programming language. Stac

Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position

How branching takes place in Instruction pipeline. Explain with suitable examples

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

Explain binary search with an example

A depth-first traversal of a tree visits a nodefirst and then recursively visits the subtrees of that node. Similarly, depth-first traversal of a graph visits a vertex and then rec

The quick sort algorithm exploit design technique Divide and Conquer