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

When can we see layer groups in gimp, Sometimes it is nice to place layers ...

Sometimes it is nice to place layers in groups. It makes them simple to organize when you have lots of them. It also means you can simply apply the similar effect to lots of layers

Mating - canonical genetic algorithm, Mating: Therefore once our GA ag...

Mating: Therefore once our GA agent has chosen the individuals lucky sufficient as actually there  fit enough to produce offspring then we next determine how they are going to

Explain about physical model, Explain about Physical model The Physical...

Explain about Physical model The Physical model describes concrete software and hardware components of system's context or implementation.

What is the significance of nonactionattribute, In general, all public proc...

In general, all public processes of a controller class are treated as action processes. If you require prevent this default behaviour, just decorate the public process with NonActi

Bilinear interpolated images , Transfer  Functions Change the last bili...

Transfer  Functions Change the last bilinear interpolated images and the original images into the frequency domain using the FFT.  Try to measure the magnitude transfer functio

Define service (within r/3), Define service (within R/3)? A service is...

Define service (within R/3)? A service is a process or group of processes that perform a exact system function and often give an application-programming interface for other pr

What are the advantages of CMOS logic, What are the advantages of CMOS logi...

What are the advantages of CMOS logic Ans: Advantages of CMOS Logic: (i) The power dissipation is mini-mum of all the logic families (ii) LSI and VLSI are possible

Tightly coupled system- shared memory system, Tightly Coupled System- Share...

Tightly Coupled System- Shared Memory System Shared memory multiprocessorshas has following description: Every processor commune through a shared global memory. For

Illustrate the benefits of functional model, Illustrate the benefits of Fun...

Illustrate the benefits of Functional model Functional model shows how values are computed. This model describes decisions or object structure without regard for sequencing. I

What are different queues used, 1.Local queue -is a actual queue 2.Clus...

1.Local queue -is a actual queue 2.Cluster queue -is a local queue that is called as throughout a cluster of queue managers 3. Remote queue -structure explaining a queue

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