Register

order of leaf node in b+ tree??

• edited by
5,934 views
6 votes
6 votes
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
• edited by
User Avatar

1 Answer

Best answer
9 votes
9 votes
For n keys,each key must be store at leaf level.So 1st option is correct.

N*(Key+RecordPointer)+BlockPointer<=Block Size
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
2 answers
2
Himanshu1 asked Jan 2, 2016
3,506 views
B+ Tree(order of Internal node)
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $3$ bytes, the search field value takes $17$ bytes, and the block size is $1024$ bytes. The order of the internal node is_______.
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $3$ bytes, the search field value tak...
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
0 votes
0 votes
1 answer
4
shruti goel asked Jan 26, 2016
353 views
The order of leaf node in b + tree ia the
What is the order of leaf node in the b+ tree
What is the order of leaf node in the b+ tree
User Avatar
Link Copied!