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 the benefits of broadcast model approach, a. Determine the non-functi...

a. Determine the non-functional system requirements that might be chosen for an application for a particular style and structures? b. Write the benefits of broadcast model appro

Explain the working of a weighted register d/a converter, With the help of ...

With the help of a neat diagram, explain the working of a weighted-resistor D/A converter. Ans Weighted Register D/A Converter:   Digital input that has 4 bits

Compute the positive integer and square root, Question: Q1) Write a cod...

Question: Q1) Write a code that asks the user for a positive integer, computes the square root of that integer, and return the result to the user. The computational error needs

How to fix an asic-based design from easiest to most extreme, How to fix an...

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

What interface is extended by awt event listeners, All AWT event listeners ...

All AWT event listeners expand the java.util.EventListener interface.

Push and pop, i want flowchart for push, pop in stack element and display s...

i want flowchart for push, pop in stack element and display stack and exit

What search method would be most appropriate and why, (a) Describe fully in...

(a) Describe fully in your own words the following terms: (i) Turing Test (ii) Agent (iii) Utility-based agent (b) A Mars rover has to leave the lander, collect rock sample

How to create an html document, An HTML document can be created by using an...

An HTML document can be created by using any HTML editor or text editor such as notepad etc. STEPS FOR CREATING A SIMPLE HTMLPROGRAM   1. Go to Start -> Programs->A

Explain speedup performance and issues in pipelining, Speedup First, we...

Speedup First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup. Let n b

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