Tree-Based Indexes
``Find all students with gpa > 3.0’’
- If data is in sorted file, do binary search to find first such student, then scan to find others.
- Cost of binary search can be quite high.
Simple idea: Create an `index’ file.
- Can do binary search on (smaller) index file!