Indexes that are too large to hold in memory I
Problems:
- Binary searching requires several seeks rather than being performed at memory speed.
- Index rearrangement requires shifting or sorting records on secondary storage ==> Extremely time consumming.
Solutions:
- Use a hashed organization
- Use a tree-structured index (e.g., a B-Tree)