Move computation for presence of an expression in a sub tree logic to ProjectionAST

XMLWordPrintableJSON

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

      In this approach we walk the projection AST in order to compute _subtreeContainsComputedFields. After the traversal, the projection AST would already be tagged at all the places where
      there are no descendent expressions. We could then transmit this knowledge
      directly to the nodes of the execution tree as we construct them in
      'projection_executor_builder.cpp'.

              Assignee:
              Arun Banala
              Reporter:
              Arun Banala
              Votes:
              0 Vote for this issue
              Watchers:
              2 Start watching this issue

                Created:
                Updated:
                Resolved: