Algorithm to insert a key in b-tree, Computer Engineering

Assignment Help:

Algorithm to insert a key in B-tree is as follows:

1.  First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into the proper order.

2.  If the node can contain the new record, insert the new record at the appropriate pointer so that number of pointers remains one more than the number of records.

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

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

 


Related Discussions:- Algorithm to insert a key in b-tree

Determine the object oriented principles, Determine the Object oriented pri...

Determine the Object oriented principles Many latest applications are being developed based on object oriented principles such as methods, classes, and inheritance. To fulfil

Information system today, What is the benefit of MITRE''s evolutionary appr...

What is the benefit of MITRE''s evolutionary approach to KM?

Emerging cloud computing technology, A chart illustrating the differences a...

A chart illustrating the differences among the new cloud-based technologies (Workday) and the traditional . a. The new cloud-based solutions benefit Workday from every facet wh

How can a shift register be used as a counter, What is a shift register? Ca...

What is a shift register? Can a shift register be used as a counter? If yes, explain how?     Ans: Shift Register: A register wherein data gets shifted towards left or right

Perform the subtraction using 1's complement, Perform the subtraction using...

Perform the subtraction using 1's complement of 11001 - 10110 Ans. 11001 - 10110 = X - Y                            X = 11001 1's complement of Y = 01001

Threads, First, remember that different processes keep their own data in di...

First, remember that different processes keep their own data in distinct address spaces. Threads, on the other hand, explicitly share their entire address space with one another. A

State the advantages of bespoke software, State the advantages of Bespoke ...

State the advantages of Bespoke Software -  specifically designed for application and hence more efficient and will only contain the features wanted; as it will be devoid of

Software Engineering, explanation of the difference between syntax and sema...

explanation of the difference between syntax and semantic errors

Survey of advanced applications, 1. Conduct a literature survey of advanced...

1. Conduct a literature survey of advanced applications of the finite element method for engineering design and analysis. 2. Identify at least one application, which interests y

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd