-
Type:
Bug
-
Resolution: Unresolved
-
Priority:
Minor - P4
-
None
-
Affects Version/s: None
-
Component/s: None
-
Query Optimization
-
ALL
-
-
None
-
None
-
None
-
None
-
None
-
None
-
None
The repro shows that different plans are chosen depending on the run. Sometimes the bounds for one branch is a point, and sometimes it's almost Minkey-Maxkey (the actual bounds are [MinKey, 0.0) U (0.0, MaxKey] )
The plan enumerator should be deterministic, we should investigate why this happens
- is related to
-
SERVER-41872 PlanEnumerator AndAssignment::choices ordering not stable and is relevant to set of plans generated
-
- Closed
-
-
SERVER-108032 Create property-based test asserting plan stability when running the same query repeatedly
-
- Closed
-
-
SERVER-12281 When choosing multikey index bounds, never choose a superset if a subset is available
-
- Backlog
-
-
SERVER-115405 Enumerate more plans in the case where we cannot combine bounds due to multikey index
-
- Backlog
-
-
SERVER-16042 Optimise $all/$and to select smallest subset as initial index bounds
-
- Closed
-
- related to
-
SERVER-107994 CBR: deterministically choose between all the plans that share the lowest cost
-
- Open
-