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

Show the liability of cpu in interrupt cycle, Q. Show the liability of CPU ...

Q. Show the liability of CPU in interrupt cycle? In the interrupt cycle the liability of CPU/Processor is to ensure whether any interrupts have happened checking presence of in

Can we specify the next screen number with a variable, Can we specify the n...

Can we specify the next screen number with a variable:- Yes, we can specify the next screen number with a variable.

What is a parent class of all java classes, Parent class of all Java classe...

Parent class of all Java classes is? All Java class's parent class is java. lang.object.

Specifying the problem - learning decision trees, Specifying the Problem: ...

Specifying the Problem: Now next here furtherly we now use to look at how you mentally constructed your decision tree where deciding what to do at the weekend. But if one way

Pruning - artificial intelligence, Pruning - Artificial intelligence Re...

Pruning - Artificial intelligence Remember that pruning a search space means deciding that particular branches should not be explored. If an agent  surly  knows that exploring

What are the two types of branch prediction techniques, What are the two ty...

What are the two types of branch prediction techniques available?  The two types of branch prediction methods are  1) Static branch prediction  2) Dynamic branch predicti

Deductive inferences - artificial intelligence, Deductive Inferences - Arti...

Deductive Inferences - Artificial intelligence: We have described how knowledge can be represented in first-order logic, and how in logic rule-based expert systems expressed ca

Explain the concept of generalization, Explain the concept of Generalizatio...

Explain the concept of Generalization Generalization and inheritance are powerful abstractions for sharing the structure and/or behaviour of more than one class.  Generalizati

Sun and nis law, Q. What is Sun and Nis Law? The Sun and Ni's Law is a ...

Q. What is Sun and Nis Law? The Sun and Ni's Law is a simplification of Amdahl's Law and Gustafson's Law. The basic concept underlying Sun and Ni's Law is to find solution to a

What is a formal description for a programming language, A grammar for a pr...

A grammar for a programming language is a formal description of ? Structure is a formal description for a programming language.

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