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

Mutability and accessibility of primary memory, Mutability and Accessibilit...

Mutability and Accessibility of primary memory: Mutability: Read/write storage or mutable storage  It provides permit ion for the information to be overwritten at

What is pci bus, What is PCI bus? The Peripheral component interconnect...

What is PCI bus? The Peripheral component interconnect(PCI) bus is a standard that handles the functions found on a processor bus but in a standardized format that is independe

What are the exceptions encountered for fp operation, What are the exceptio...

What are the exceptions encountered for FP operation? The exceptions encountered for FP operation are overflow, underflow. /0, inexact and invalid values.

Direct addressing and immediate addressing mode , Direct Addressing and  I...

Direct Addressing and  Immediate Addressing mode - computer architecture:  Immediate Addressing: It is the simplest form of addressing. Here, the operand is itself given

What are semaphores, What are semaphores? Semaphore : A semaphore is a...

What are semaphores? Semaphore : A semaphore is a synchronization tool which gives a general-purpose solution to controlling access to critical sections. It s an abstract data

Jsbjj, what are the output deice

what are the output deice

State about dynamic modelling and its inputs, State about Dynamic modelling...

State about Dynamic modelling and its inputs Dynamic modelling is elaborated further by adding concept of time: new attributes are computed, as a function of the attribute chan

Functionality of hyper thread processor, Hyper-threading works by duplicati...

Hyper-threading works by duplicating those sections of processor that kept the architectural state-but not duplicates the main implementation resources. This allows a Hyper-threadi

Robotics artificial intelligence, what is robot?explain different types of ...

what is robot?explain different types of robots with respect to joints.

Find how many bits of adc are required to get an resolution, Find how many ...

Find how many bits of ADC are required to get an resolution of 0.5 mV if the maximum full scale voltage is 10 V Ans. Given Resolution=.5mV Full scale output=+10v %resolut

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