• retagged by
1,916 views
6 6 votes

Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..

1 Answer

Best answer
6 6 votes
Just give a try for this =>

10, 3, 6, 8, 4, 2, 1

A). Use left biasing --> total 5 splits (4 leaf node and 1 internal node)

B). Use right biasing --> total 4 splits (3 leaf and 1 internal node)
• selected by
Position:
Show:

Related questions

5 5 votes
1 answers 1 answer
5.5k
5.5k views
Na462 asked May 26, 2018
5,499 views
Which of the following statements true for $B$ tree and $B^+$ tree index?A. $B$ tree index faster for range queries compare to $B^+$ tree index.B. If disk block allocated...
1 1 vote
1 1 answer
1.1k
1.1k views
Na462 asked Jun 29, 2018
1,072 views
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
3 3 votes
2 answers 2 answers
3.3k
3.3k views
aditi19 asked Nov 23, 2018
3,339 views
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
2 2 votes
1 answers 1 answer
1.0k
1.0k views
skywalker_19 asked Oct 8, 2018
1,044 views
How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree