B-Tree performance
Let h = height of the B-tree.
get(k): at most h disk accesses. O(h)
put(k): at most 3h + 1 disk accesses. O(h)
remove(k): at most 3h disk accesses. O(h)
h < log d (n + 1)/2 + 1 where d = ?m/2? (Sahni, p.641).
An important point is that the constant factors are relatively low.
m should be chosen so as to match the maximum node size to the block size on the disk.
Example: m = 128, d = 64, n ? 643 = 262144 , h = 4.