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 race condition, What is Race condition? Race condition: The c...

What is Race condition? Race condition: The circumstances where several processes access - and manipulate shared data-concurrently. The last value of the shared data depends

Define the meaning of business-to-business, Define the meaning of business-...

Define the meaning of business-to-business. B2B (business-to-business): The consensus is universal: it is the priority; it is where the money is. It’s rather true; theref

Illustrate working of rubber dome keyboards, Q. Illustrate working of rubbe...

Q. Illustrate working of rubber dome keyboards? Rubber Dome: In rubber dome keyboards both positioning and contact are controlled by a puckered sheet of elastomer that is a s

Utility functions - artificial intelligence, Utility Functions - artificial...

Utility Functions - artificial intelligence: A goal based on an agent for playing chess is infeasible: at every moment it decides which move to play next, it sees whether that

Push and pop, Suupose a stack-oriented processor that haves the stack opera...

Suupose a stack-oriented processor that haves the stack operations PUSH and POP.  Arithmetic operations automatically involve the top one or two stack elements. Starting with an

First order logic, "George has a dog called Ernie, which is a trained Labra...

"George has a dog called Ernie, which is a trained Labrador. Trained Labradors and poodles are obedient, and all obedient dogs are good dogs. All good dogs that have a master will

Explain recursion, What is recursion? Recursion: - Recursion is describ...

What is recursion? Recursion: - Recursion is described as a technique of defining a set or a process in terms of itself.

Explains the various levels of parallel processing, Levels of parallel proc...

Levels of parallel processing We could have parallel processing at four levels. i)  Instruction Level: Most processors have numerous execution units and can execute numero

Specify the goals of parsing, Specify the goals of parsing. Goals: ...

Specify the goals of parsing. Goals: a. To check the validity of source string b. To agree on the syntactic structure of a source string. For invalid string this rep

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