• retagged by
2,443 views
0 0 votes
Will block size of B tree and B+ tree same for same key size and pointer size

One more doubt

For B+ tree at leaf(Key and Record Pointer) and at non leaf node(Block pointer and Key)

So for B+ tree order for leaf node and non leaf node will be different

For B tree at leaf (Key and Record Pointer)  and at non leaf node(Block pointer ,Key and Record pointer)

But for B tree Order of leaf node and non leaf node is same

Why please say

please clear my doubt

Thank you

1 Answer

0 0 votes
Block size is independent of   key size and pointer size
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
1.9k
1.9k views
learncp asked Sep 25, 2015
1,949 views
Here, the value of p should be 24, not 23 as taken...also no reason is given for this assumption by the author (Navathe ). Can anyone explain this ?
1 1 vote
3 3 answers
2.4k
2.4k views
Pradip Nichite asked Nov 19, 2015
2,399 views
What is the minimum and maximum space utilization of b+ tree and b tree?
0 0 votes
1 1 answer
875
875 views
Subham Nagar asked Dec 15, 2018
875 views
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-TreePlease also re...
3 3 votes
2 answers 2 answers
3.4k
3.4k views
aditi19 asked Nov 23, 2018
3,368 views
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?