notebook.community
Edit and run
B+ Trees
Example:
Store 10 trillion entry on a hard-disk
$M512$
$L=39$
Best case: $h=\left[\right] = 5$
Worst case: $h=\left[\right] = 5$
In [ ]: