risingwave_frontend/optimizer/rule/max_one_row_eliminate_rule.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
// Copyright 2024 RisingWave Labs
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use super::{BoxedRule, Rule};
use crate::optimizer::plan_node::{LogicalApply, LogicalMaxOneRow};
use crate::optimizer::plan_visitor::LogicalCardinalityExt;
use crate::optimizer::PlanRef;
/// Eliminate max one row restriction from `LogicalApply`.
///
/// If we cannot guarantee that the right side of `Apply` will return at most one row
/// in compile time, we will add a `MaxOneRow` that does runtime check to satisfy the
/// max one row restriction.
///
/// As a result, the `max_one_row` flag of `LogicalApply` will always be `false`
/// after applying this rule.
pub struct MaxOneRowEliminateRule {}
impl Rule for MaxOneRowEliminateRule {
fn apply(&self, plan: PlanRef) -> Option<PlanRef> {
let apply: &LogicalApply = plan.as_logical_apply()?;
let (left, mut right, on, join_type, correlated_id, correlated_indices, max_one_row) =
apply.clone().decompose();
if !max_one_row {
return None;
}
if !right.max_one_row() {
right = LogicalMaxOneRow::create(right);
debug_assert!(right.max_one_row());
}
Some(LogicalApply::create(
left,
right,
join_type,
on,
correlated_id,
correlated_indices,
false,
))
}
}
impl MaxOneRowEliminateRule {
pub fn create() -> BoxedRule {
Box::new(MaxOneRowEliminateRule {})
}
}