B+ Tree Index files
A B+ index tree is a balanced tree in which every path from root to leaf is of same length and each non-leaf node has between ceiling(n/2) and n nodes where n is fixed.
Typical node is a B+ tree:
n-1 search keys K1, K2,… Kn-1
n pointers P1, P2, …Pn