Register

B+ tree

785 views
1 votes
1 votes

Assume a system has following parameters to construct a B+ tree. The specification of the tree are:
• Size of search key is 15 B
• Size of block is 512 B
• Size of record pointer is 9 B
• Size of block pointer is 8 B
The maximum number of keys that can be accommodated in each non-leaf node of the tree is ________.

User Avatar

1 Answer

4 votes
4 votes

(porder * pblock) + (porder -1) * V <= Block Size

Here,  pblock =8B

V= 15B

Block Size = 512B

So, (porder * 8) + (porder -1) * 15<= 512

porder  <= 22.913

or, porder =22

For a non-leaf node in a B+ tree, max number of keys= porder - 1

porder - 1 = 21

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

Related questions

0 votes
0 votes
1 answer
1
iarnav asked Dec 15, 2017
1,403 views
B+ Tree Question
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
User Avatar
6 votes
6 votes
1 answer
2
firki lama asked Jan 14, 2017
5,934 views
order of leaf node in b+ tree??
which formula should we use for calculating LEAF node in B+ tree? I. n*(K+r)+b<=block size where n=no of keys k=key size,r=record pointer,b=block pointer II. (n-1)(K+r)+b<=block size
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...
User Avatar
18 votes
18 votes
1 answer
3
Akanksha Kesarwani asked Dec 10, 2016
6,381 views
left biasing and right biasing in B+ tree insertion
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
User Avatar
1 votes
1 votes
1 answer
4
Pawan Kumar 2 asked Dec 7, 2017
1,025 views
B+ tree
$\text{Insertion Sequence}$ : $8,5,1,7,3,12,9,6$ Can someone plz show the Sequence of insertion in B+ tree step by step Thanks
$\text{Insertion Sequence}$ : $8,5,1,7,3,12,9,6$Can someone plz show the Sequence of insertion in B+ tree step by step Thanks
User Avatar
Link Copied!