# Indexing

234 views

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

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.

selected
0

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

1
977 views
Which of the following statements true for $B$ tree and $B^+$ tree index? A. $B$ tree index faster for range queries compare to $B^+$ tree index. B. If disk block allocated for $B^+$ tree index and same size disk block allocated for $B$ tree index then number of index ... cost of $B^+$ tree index less than equal to I/O cost of $B$ tree index for random access of same key from set of distinct keys.
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.