Selection Implementation
No relevant index, unsorted data:
No index, sorted data (on relevant attribute):
- binary search to find 1st occurrence, then read
B+ tree index (on relevant attr.)
- Search tree to find occurrences
- Cost depends on whether index is clustered or not
- Works for range as well as = selections
Hash index: works only for = selections which match the hash field