[SERVER-76637] [SBE] Improve performance of workloads with large/complex MatchExpression predicates Created: 27/Apr/23 Updated: 28/Apr/23 |
|
| Status: | Backlog |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | Task | Priority: | Major - P3 |
| Reporter: | Kyle Suarez | Assignee: | Backlog - Query Execution |
| Resolution: | Unresolved | Votes: | 0 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||
| Assigned Teams: |
Query Execution
|
||||
| Participants: | |||||
| Linked BF Score: | 100 | ||||
| Description |
|
We know that SBE is not as fast as the classic engine on workloads with very large MatchExpressions (for example, MatchExpressionWidePredicateWithDeepFieldpaths and MatchExpressionOneHundredClauseRootedAnd). The goal of this ticket is to find a way to claw back performance for these types of benchmarks. |