-
Type:
Task
-
Resolution: Unresolved
-
Priority:
Major - P3
-
None
-
Affects Version/s: None
-
Component/s: None
-
None
-
Query Optimization
The catalog has a function to get the number of orphans present on a shard. This will allow us to estimate the cardinality of the shard filter stage.
It is still an open question as to whether doing this is better than always estimating shard filter to have a hard-coded selectivity. We can certainly construct scenarios in which a large number of orphans could affect the optimal access-path.
- is depended on by
-
SERVER-99073 Support CE and costing of the shard filter stage
-
- Needs Scheduling
-