edited by
407 views

1 Answer

0 votes
0 votes
we know index records are present only at leaf levels in B+ tree no no. of index blocks are less hence we have to do more I/O(move the block from disk to RAM) if required index block is not in the tree(in RAM)

but in B tree we have more index blocks so I/O cost is less

Related questions

0 votes
0 votes
1 answer
1
Markzuck asked Dec 18, 2018
466 views
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?
1 votes
1 votes
1 answer
2
0 votes
0 votes
0 answers
4