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

Write examples of declarations of external variables, Examples of declarati...

Examples of declarations of external variables  that  are  not definitions: extern char stack[10]; extern int stkptr; These declarations tell the compiler that the variab

Define the translator which perform macro expansion, Define the translator ...

Define the translator which perform macro expansion is known as a                      Macro pre-processor is the translator which perform macro expansion

Explain public switched telephone network, Explain Public Switched Telephon...

Explain Public Switched Telephone Network. PSTN (Public Switched Telephone Network): This is Public Switched Telephone Network (PSTN), which accommodates two types of subscri

Explain about two-pass assembler, Q. Explain about Two-pass assembler? ...

Q. Explain about Two-pass assembler? Assemblers usually make two or more passes through a source program in order to resolve forward references in a program. A forward referenc

Computers and cntrol, Define open and closed loop cotrol systems.Explain di...

Define open and closed loop cotrol systems.Explain difference between time varying and time invariant control system wth suitable example

What are transmission bridges, What are transmission bridges? A usual ...

What are transmission bridges? A usual transmission bridge is demonstrated in figure. The series capacitance and the shunt inductances of the two relays give a high-pass filte

Explain macros and macro processors, System Software 1. Explain MASM? E...

System Software 1. Explain MASM? Explain its features. 2. What is the significance of Lexical analysis and Syntax analysis? 3. Explain macros and macro processors? Explai

Define the emphasis on object structure, Define the Emphasis on Object Stru...

Define the Emphasis on Object Structure Emphasis on Object Structure, not on Operation Implementation In object orientation the importance is on specifying the qualities

Define mercantile process model from perspect of merchant, Define Mercantil...

Define Mercantile Process Model from the Merchant’s perspective along with a suitable diagram. This model consists of three activities into the purchase consummation phase: Aut

What is pipelining, What is pipelining? It is a method of decomposing a...

What is pipelining? It is a method of decomposing a sequential process into sub-operations, with each sub-process being implemented in a special dedicated segment that operates

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