Indexing

Question

How to prove that if same size blocks are allocated to B trees and B+ trees then:-

No. of index nodes in B tree   >=  No. Of index nodes in B+ tree

Answer 1

I think logically we can solve,

Like in B tree consists of both key field and data pointer is stored .

In B+ tree it is only key field and record pointer ( which is considerably less than data pointer value).

So, effective usage of node is improved in B+ tree.

Comments

muthu Kumar 

In a B+ tree, it is an only key field and block pointer(not record pointer) and since block pointer points to only block whereas record pointer points block as well as record, so block pointer is less than the size of record pointer.