[SERVER-71846] [CQF] Utility to convert a BoolExpr tree between CNF and DNF Created: 05/Dec/22 Updated: 29/Oct/23 Resolved: 22/Dec/22 |
|
| Status: | Closed |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | 6.3.0-rc0 |
| Type: | Improvement | Priority: | Major - P3 |
| Reporter: | Svilen Mihaylov (Inactive) | Assignee: | Hana Pearlman |
| Resolution: | Fixed | Votes: | 0 |
| Labels: | cascades-starter | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||||||
| Assigned Teams: |
Query Optimization
|
||||||||
| Backwards Compatibility: | Fully Compatible | ||||||||
| Sprint: | QO 2022-12-26 | ||||||||
| Participants: | |||||||||
| Description |
|
This will be needed for support of index unioning and index intersection. In order to perform intersection we need to essentially split the predicates in conjunction (to join them) and for that we need CNF. For index unioning by contrast we need to union the predicates (thus we need DNF). |
| Comments |
| Comment by Githook User [ 22/Dec/22 ] |
|
Author: {'name': 'Hana Pearlman', 'email': 'hana.pearlman@mongodb.com', 'username': 'HanaPearlman'}Message: |