-
Type:
Improvement
-
Resolution: Gone away
-
Priority:
Major - P3
-
None
-
Affects Version/s: None
-
Component/s: None
-
None
-
Query Optimization
-
None
-
3
-
None
-
None
-
None
-
None
-
None
-
None
The BoolExpr::Builder linearly searches through nodes to deduplication while building. For large expressions this is inefficient. We could instead hold a set data type of nodes.
This was an issue for large $match of the form
{$match: {a: 1, b: 2, c: 3, ...}}
As part of this ticket, we should run performance tests to see if adding an extra set to the builder slows down smaller queries.
- is related to
-
SERVER-73827 [CQF] Extend BoolExpr builder to accept a simplification routine to apply as the tree is built
-
- Closed
-
- related to
-
-
- Closed
-