-
Type:
Improvement
-
Resolution: Fixed
-
Priority:
Critical - P2
-
Affects Version/s: None
-
Component/s: None
-
Query Optimization
-
Fully Compatible
-
None
-
None
-
None
-
None
-
None
-
None
-
None
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.
- is depended on by
-
SERVER-124377 Remove limit on $in list length forcing fallback to multiplanning
-
- Closed
-
- is related to
-
SERVER-108776 Improve sampling CE performance in the presence of large $in lists
-
- Closed
-
- related to
-
SERVER-124126 Prevent CE caching above a threshold number of intervals in an index bounds set
-
- Closed
-
-
SERVER-124468 Implement matchesInterval() using IndexBoundsChecker::intervalCmp()
-
- Needs Scheduling
-
-
SERVER-124880 Add synthetic benchmarks for queries with huge number of index intervals
-
- Needs Scheduling
-