Selection in Sorted Files (cont)
The above method treats each bucket like a single large page.
Cases:
- best: find tuple in first data page we read
- worst: full binary search, and not found
- examine log2b data pages
- plus examine all of their overflow pages
- average: examine some data pages + their overflow pages
Costone :
Best = 1
Worst = log2 b + bov
Average case cost analysis relies on assumptions (e.g. data distribution)
|