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

The field sy-dynr, The field SY-DYNR refers to Number of the current sc...

The field SY-DYNR refers to Number of the current screen.

Describe COMS inverter, Describe CMOS inverter. Ans: CMOS inverter t...

Describe CMOS inverter. Ans: CMOS inverter that is also called Complementary MOSFET Inverters, are several of the most broadly used and adaptable MOSFET inverters utilized i

Explain real time operating system, Explain Real Time Operating System? ...

Explain Real Time Operating System? Real time operating System: A real-time operating system has suitably-defined, fixed time constraints. Processing should be done in the d

Provide a diagrammatic interpretation of the hardware stack, a) Prototype ...

a) Prototype a macro known AP which takes 4 integer parameters n (number of terms), a (first term), l (last term) and Sum (sum of n terms), provided that: Sum = (a+l)*n/2 b)

Evaluation function - canonical genetic algorithm, Evaluation function - ca...

Evaluation function - canonical genetic algorithm: However note that this termination check may be related or the same as the evaluation function - that discussed later - but

Determine the example - fork-join, Determine the Example - "fork-join" ...

Determine the Example - "fork-join" module initial_fork_join(); reg clk,reset,enable,data; initial begin $monitor("‰g clk=‰b reset=‰b enable=‰b data=‰b", $time, cl

Give the decription of user case, Give the decription of user case A us...

Give the decription of user case A use case is a description of the set of the sequence of actions which a system performs to produce an observable result which is of a value t

Cobol coding, What is cobol codin for heap sort?

What is cobol codin for heap sort?

What are the requirements a dialog program must fulfill, What are the requi...

What are the requirements a dialog program must fulfill? A dialog program must fulfil the following requirements A user friendly user interface. - Format and consistency

Determine the list of micro-operations, Micro-Operations A micro-operat...

Micro-Operations A micro-operation is an basic operation which is performed on data stored in registers. We can classify micro-operations into four categories: 1. Register t

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