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
infix to revrse polish

Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].

hello, i need help in data mining assignment using sas em and crisp-dm

RENDERING, SHADING AND COLOURING By introducing hidden line removal we have already taken one step away from wire-frame drawings towards being able to realistically model and d


Write an algorithm using pseudocode which takes temperatures input over a 100 day period (once per day) and output the number of days when the temperature was below 20C and the num

The minimum cost spanning tree has broad applications in distinct fields. It represents several complicated real world problems such as: 1. Minimum distance for travelling all o

solve the following relation by recursive method: T(n)=2T(n^1/2)+log n

what is frequency count with examble? examble?