pub struct EliminateCrossJoin;
Implementations§
Trait Implementations§
source§impl Default for EliminateCrossJoin
impl Default for EliminateCrossJoin
source§fn default() -> EliminateCrossJoin
fn default() -> EliminateCrossJoin
Returns the “default value” for a type. Read more
source§impl OptimizerRule for EliminateCrossJoin
impl OptimizerRule for EliminateCrossJoin
Eliminate cross joins by rewriting them to inner joins when possible.
§Example
The initial plan for this query:
select ... from a, b where a.x = b.y and b.xx = 100;
Looks like this:
Filter(a.x = b.y AND b.xx = 100)
CrossJoin
TableScan a
TableScan b
After the rule is applied, the plan will look like this:
Filter(b.xx = 100)
InnerJoin(a.x = b.y)
TableScan a
TableScan b
§Other Examples
- ‘select … from a, b where a.x = b.y and b.xx = 100;’
- ‘select … from a, b where (a.x = b.y and b.xx = 100) or (a.x = b.y and b.xx = 200);’
- ’select … from a, b, c where (a.x = b.y and b.xx = 100 and a.z = c.z)
- or (a.x = b.y and b.xx = 200 and a.z=c.z);’
- ‘select … from a, b where a.x > b.y’
For above queries, the join predicate is available in filters and they are moved to join nodes appropriately
This fix helps to improve the performance of TPCH Q19. issue#78
source§fn supports_rewrite(&self) -> bool
fn supports_rewrite(&self) -> bool
Does this rule support rewriting owned plans (rather than by reference)?
source§fn rewrite(
&self,
plan: LogicalPlan,
config: &dyn OptimizerConfig,
) -> Result<Transformed<LogicalPlan>>
fn rewrite( &self, plan: LogicalPlan, config: &dyn OptimizerConfig, ) -> Result<Transformed<LogicalPlan>>
Try to rewrite
plan
to an optimized form, returning Transformed::yes
if the plan was rewritten and Transformed::no
if it was not. Read moresource§fn try_optimize(
&self,
_plan: &LogicalPlan,
_config: &dyn OptimizerConfig,
) -> Result<Option<LogicalPlan>>
fn try_optimize( &self, _plan: &LogicalPlan, _config: &dyn OptimizerConfig, ) -> Result<Option<LogicalPlan>>
👎Deprecated since 40.0.0: please implement supports_rewrite and rewrite instead
Try and rewrite
plan
to an optimized form, returning None if the plan
cannot be optimized by this rule. Read moresource§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 EliminateCrossJoin
impl RefUnwindSafe for EliminateCrossJoin
impl Send for EliminateCrossJoin
impl Sync for EliminateCrossJoin
impl Unpin for EliminateCrossJoin
impl UnwindSafe for EliminateCrossJoin
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
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more