[SERVER-75063] Support more complex scan bounds for clustered index Created: 20/Mar/23 Updated: 08/Jun/23 |
|
| Status: | Backlog |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | Improvement | Priority: | Major - P3 |
| Reporter: | Hana Pearlman | Assignee: | Backlog - Query Optimization |
| Resolution: | Unresolved | Votes: | 1 |
| Labels: | query-product-scope-2, query-product-urgency-2, query-product-value-2 | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||||||
| Assigned Teams: |
Query Optimization
|
||||||||
| Participants: | |||||||||
| Case: | (copied to CRM) | ||||||||
| Description |
|
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. |