The Sparse Index Is the Key to the Hash Index, Right?

In both, you had a in memory. You just had a small index that was the key to a bite off set where you know where that thing wasin memory. In the hash the problem is, if the hash got if you had too many keys, then it keed up all your memory. With the sparse index, instead of that, it's saving a key that's at the beginning of a segment and its offset. So instead of having a mill at same example, you might only have a thousandle le. It's as fast as the o of one operation that the n memory index gives you, but it's not much worse.