Question: Database Systems Lets us assume that a node of a B+ tree is implemented as a block whose size is 4K bytes. A key in
Database Systems
Lets us assume that a node of a B+ tree is implemented as a block whose size is 4K bytes. A key in a node takes 12 bytes and the size of a pointer in a node is 8 bytes. Let us assume we have a total 6 blocks in the leaf level. If a fill factor of the B+ tree is 67%, the maximum number of keys in a node is approximately 200. Calculate the average fan-out and height of the B+ tree.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
