| This is a good analysis. As was pointed out, the real issue is the size of the index structure itself, which can become huge. If you look in your textbook, you will recall a reading on b-trees, which are a modification of the binary search tree structure that is designed to work when the amount of data is too large to fit into memory. |