When checking if a document satisfies a set of IndexBounds, we first extract all the index keys, then for each one we check if each component is in corresponding OrderedIntervalList for that field. This check currently iterates over all the intervals in order. Instead, we can perform a binary search as we know the OrderIntervalList is sorted. This may help improve the sampling time for large indexed $in queries.