Struct datafusion::optimizer::decorrelate::PullUpCorrelatedExpr

pub struct PullUpCorrelatedExpr {
    pub join_filters: Vec<Expr>,
    pub correlated_subquery_cols_map: HashMap<LogicalPlan, BTreeSet<Column>>,
    pub in_predicate_opt: Option<Expr>,
    pub exists_sub_query: bool,
    pub can_pull_up: bool,
    pub need_handle_count_bug: bool,
    pub collected_count_expr_map: HashMap<LogicalPlan, HashMap<String, Expr>>,
    pub pull_up_having_expr: Option<Expr>,
}

This struct rewrite the sub query plan by pull up the correlated expressions(contains outer reference columns) from the inner subquery’s ‘Filter’. It adds the inner reference columns to the ‘Projection’ or ‘Aggregate’ of the subquery if they are missing, so that they can be evaluated by the parent operator as the join condition.

Fields

join_filters: Vec<Expr>

correlated_subquery_cols_map: HashMap<LogicalPlan, BTreeSet<Column>>

in_predicate_opt: Option<Expr>

exists_sub_query: bool

can_pull_up: bool

need_handle_count_bug: bool

collected_count_expr_map: HashMap<LogicalPlan, HashMap<String, Expr>>

pull_up_having_expr: Option<Expr>

Trait Implementations

impl TreeNodeRewriter for PullUpCorrelatedExpr

type Node = LogicalPlan

The node type which is rewritable.

fn f_down( &mut self, plan: LogicalPlan ) -> Result<Transformed<LogicalPlan>, DataFusionError>

Invoked while traversing down the tree before any children are rewritten. Default implementation returns the node as is and continues recursion.

fn f_up( &mut self, plan: LogicalPlan ) -> Result<Transformed<LogicalPlan>, DataFusionError>

Invoked while traversing up the tree after all children have been rewritten. Default implementation returns the node as is and continues recursion.