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

Explain how viewstate is being formed, Explain how Viewstate is being forme...

Explain how Viewstate is being formed and how it is keeps on client. The type of ViewState is System.Web.UI.StateBag, which is a dictionary that keeps name/value pairs. View St

Explain the different fields of an instructions, Explain the significance o...

Explain the significance of different fields of an instruction An instruction is a command given to a computer to perform a particular operation on some given data and the form

Explain passing parameters using pointers, Q. Explain Passing Parameters Us...

Q. Explain Passing Parameters Using Pointers ? This method overcomes the drawback of using variable names directly in procedure. It uses registers to pass procedure pointers to

What is the ''blocking factor'' of a file, The "blocking factor" of a file ...

The "blocking factor" of a file is? Ans. The number of logical records in single physical record is called the "blocking factor" of a file.

Explain anonymous FTP, Explain Anonymous FTP. Use of a login password...

Explain Anonymous FTP. Use of a login password and name helps maintain file secure from unauthorized access. Though, sometimes these authorizations can also be inconvenient.

Initial considerations in problem solving, Initial considerations in proble...

Initial considerations in problem solving: Three initial considerations in problem solving for easiest(as described in Russell and Norvig):  Initial State  First

Explain function of dual slope analogue to digital converter, Draw and expl...

Draw and explain the function of dual slope analogue to digital converter. Derive the equations used. Ans.               Dual slope A/D converter : This has 4 main blocks.

Explain about the term false path, Explain about the term false path? How i...

Explain about the term false path? How it find out in circuit? What the effect of false path in circuit? By timing all the paths into the circuit the timing analyzer can find o

Flynns categorization, Normal 0 false false false EN-US...

Normal 0 false false false EN-US X-NONE X-NONE

What are the major components of a web browser, What are the major componen...

What are the major components of a web browser? A browser contains a set of clients, a controller and a set of interpreters which manages them. All browsers must have an HTML

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