GATEverse Practice, past papers & mock tests
GATE 2008
Database ManagementIndexingmediumNAT2 marks
A database file has 1,000,000 records. A secondary B+ tree index is built on a search key field. If each internal node can hold up to 100 pointers and the tree is balanced, what is the maximum height of the B+ tree (number of levels from root to leaf)?
Save your progress

Related Database Management PYQs