17
Selection in Sorted Files
(cont)
For
range
queries on unique sort key
(e.g. primary key)
:
use binary search to find lower bound
read sequentially until reach upper bound
Cost
range
= Cost
one
+ (b
q
-1).(1+Ov)
If secondary key, similar method to
pmr
.