Right now, clustered collection scans can be bounded by a min value and max value. This works well for queries containing $eq, $lt/e, $gt/e, and $and. But, it's not sophisticated enough to most efficiently bound queries containing $in and $or. These queries would benefit from bounds that look more like a set of ranges.