Register

B+ TREE

426 views
0 votes
0 votes

What does this sentence mean ? 

A B+ - tree of order d is a tree in which each internal node has between  d and  2d key values.

User Avatar

1 Answer

0 votes
0 votes

I am assuming that you know basics of B and B+ trees.

"A B+ - tree of order d is a tree in which each internal node has between  d and  2d key values."

Means internal node will have min. d keys and d+1 pointer

And maximum 2d keys and 2d+1 pointers

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Sahil_Lather asked Jan 29, 2023
516 views
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
User Avatar
0 votes
0 votes
3 answers
2
Na462 asked Feb 2, 2019
2,097 views
B+ Tree Records
User Avatar
0 votes
0 votes
0 answers
3
bts1jimin asked Jan 9, 2019
386 views
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
User Avatar
0 votes
0 votes
1 answer
4
Markzuck asked Dec 18, 2018
488 views
MadeEasy Subject Test 2019: Databases - B Tree
By default take ROOT at level 1 or 0? and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?
By default take ROOT at level 1 or 0?and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?
User Avatar
Link Copied!