[CQF] Boolean minimization for BoolExpr based on Quine-McCluskey simplification

XMLWordPrintableJSON

    • Type: Improvement
    • Resolution: Won't Do
    • Priority: Major - P3
    • None
    • Affects Version/s: None
    • Component/s: None
    • Query Optimization
    • None
    • 3
    • None
    • None
    • None
    • None
    • None
    • None

      Implement a boolean expression minimizer for bool expr trees. One way to achieve that is to minimize a bool expr tree when it is constructed by the builder (say when .finish() is called). This will allow a more optimal and minimized representation of the boolean tree, which may not conform neither to DNF nor CNF. This can be used to support more efficient index and fetch rewrites.

       

      Note this is a more general version of the "local" simplification to be achieved via 
      SERVER-73827

            Assignee:
            [DO NOT USE] Backlog - Query Optimization
            Reporter:
            Svilen Mihaylov (Inactive)
            Votes:
            0 Vote for this issue
            Watchers:
            10 Start watching this issue

              Created:
              Updated:
              Resolved: