pub struct ExtractEquijoinPredicate;
Expand description
Optimizer that splits conjunctive join predicates into equijoin predicates and (other) filter predicates.
Join algorithms are often highly optimized for equality predicates such as x = y
,
often called equijoin
predicates, so it is important to locate such predicates
and treat them specially.
For example, SELECT ... FROM A JOIN B ON (A.x = B.y AND B.z > 50)
has one equijoin predicate (A.x = B.y
) and one filter predicate (B.z > 50
).
See find_valid_equijoin_key_pair for more information on what predicates
are considered equijoins.
Implementations§
Trait Implementations§
source§impl Default for ExtractEquijoinPredicate
impl Default for ExtractEquijoinPredicate
source§fn default() -> ExtractEquijoinPredicate
fn default() -> ExtractEquijoinPredicate
Returns the “default value” for a type. Read more
source§impl OptimizerRule for ExtractEquijoinPredicate
impl OptimizerRule for ExtractEquijoinPredicate
source§fn try_optimize(
&self,
plan: &LogicalPlan,
_config: &dyn OptimizerConfig
) -> Result<Option<LogicalPlan>>
fn try_optimize( &self, plan: &LogicalPlan, _config: &dyn OptimizerConfig ) -> Result<Option<LogicalPlan>>
Try and rewrite
plan
to an optimized form, returning None if the plan cannot be
optimized by this rule.source§fn apply_order(&self) -> Option<ApplyOrder>
fn apply_order(&self) -> Option<ApplyOrder>
How should the rule be applied by the optimizer? See comments on
ApplyOrder
for details. Read moreAuto Trait Implementations§
impl Freeze for ExtractEquijoinPredicate
impl RefUnwindSafe for ExtractEquijoinPredicate
impl Send for ExtractEquijoinPredicate
impl Sync for ExtractEquijoinPredicate
impl Unpin for ExtractEquijoinPredicate
impl UnwindSafe for ExtractEquijoinPredicate
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more