Question: A database uses B+ Tree to build an index on a search key. Assume that a page stores only one B+ Tree node. Each node
A database uses B+ Tree to build an index on a search key. Assume that a page stores only one B+ Tree node. Each node can store at most N keys.
(1) What is the maximal number of records we can index if the B+ tree has 3 levels?
(2) To search a record with this index, how many IO read is required?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
