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

What is constrained-random verification, What is Constrained-Random Verific...

What is Constrained-Random Verification ? As ASIC and system-on-chip (SoC) designs continue to increase in size and complexity, there is an equal or greater increase in the si

Write a menu driven program to perform addition, Q. Write a menu driven pr...

Q. Write a menu driven program to perform addition and subtraction in base 5. Check that entered numbers are in base 5 or not else error message should be displayed.

What are ramps, Ramps A network planning method that makes the most wel...

Ramps A network planning method that makes the most well-organized use of manpower, materials and cash resources between several projects going on concurrently.

Definition of lists, Q. Definition of Lists? Another type of list is a ...

Q. Definition of Lists? Another type of list is a definition list. Definition lists have a heading and text appears below that. EXPERTSMI

Backpropagation learning routine, Backpropagation Learning Routine: Co...

Backpropagation Learning Routine: Conversely as with perceptrons there the information in the network is stored in the weights than the learning problem comes down to the ques

Default communicator in mpi, Problem 1 (a) What is the difference betw...

Problem 1 (a) What is the difference between an MPI blocking send function and an MPI non-blocking send function? (b) What is a communicator in MPI? (c) Name correctly

Registered ports, A) What does this file have? Where was the information in...

A) What does this file have? Where was the information in this file acquired from? What is the information in this file used for? B)  What is the range for popular ports? What i

Operating system, explain network operating system and design issues?

explain network operating system and design issues?

Explain the functioning of firewall using screening router, Explain the fun...

Explain the functioning of Firewall Using Screening Router. Firewall Using Screening Router: The risk of break-within is large along with this form of firewall: Eve

Invoke on the dataadapter control, Which method do you invoke on the DataAd...

Which method do you invoke on the DataAdapter control to load  your generated dataset with data? DataAdapter.Fill(ds). The beauty of this method is it automatically implicitly

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