The Gateway to Computer Science Excellence
+1 vote

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

in Databases by (77 points) | 113 views

1 Answer

0 votes
Best answer
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.
by Active (1.7k points)
selected by

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.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,321 answers
105,145 users