risingwave_frontend/optimizer/rule/
intersect_merge_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
// 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::{LogicalIntersect, PlanTreeNode};
use crate::optimizer::PlanRef;

pub struct IntersectMergeRule {}
impl Rule for IntersectMergeRule {
    fn apply(&self, plan: PlanRef) -> Option<PlanRef> {
        let top_intersect: &LogicalIntersect = plan.as_logical_intersect()?;
        let top_all = top_intersect.all();
        let mut new_inputs = vec![];
        let mut has_merge = false;
        for input in top_intersect.inputs() {
            if let Some(bottom_intersect) = input.as_logical_intersect()
                && bottom_intersect.all() == top_all
            {
                new_inputs.extend(bottom_intersect.inputs());
                has_merge = true;
            } else {
                new_inputs.push(input);
            }
        }

        if has_merge {
            Some(top_intersect.clone_with_inputs(&new_inputs))
        } else {
            None
        }
    }
}

impl IntersectMergeRule {
    pub fn create() -> BoxedRule {
        Box::new(IntersectMergeRule {})
    }
}