Using a B Plus Tre Data Structure?

We only store keys in the interior hages and keep the tual data at the leaf. That means you can fit the maximum proportion of the key index in memory, so you not always hapving to go back to the fall system to get the ke ran. If you have a very large data base, you could wind up with portions of the interior index also pushed outside of memory. So it's not a fixed number, mistress. You cram in as much as will fit before you have to overflow into a new page.