risingwave_meta/hummock/compaction/
overlap_strategy.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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
// 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 std::cmp;
use std::fmt::Debug;
use std::ops::Range;

use itertools::Itertools;
use risingwave_hummock_sdk::key_range::{KeyRange, KeyRangeCommon};
use risingwave_hummock_sdk::sstable_info::SstableInfo;
use risingwave_hummock_sdk::KeyComparator;

pub trait OverlapInfo: Debug {
    fn check_overlap(&self, a: &SstableInfo) -> bool;
    fn check_multiple_overlap(&self, others: &[SstableInfo]) -> Range<usize>;
    fn check_multiple_include(&self, others: &[SstableInfo]) -> Range<usize>;
    fn update(&mut self, table: &SstableInfo);
}

pub trait OverlapStrategy: Send + Sync {
    fn check_overlap(&self, a: &SstableInfo, b: &SstableInfo) -> bool;
    fn check_base_level_overlap(
        &self,
        tables: &[SstableInfo],
        others: &[SstableInfo],
    ) -> Vec<SstableInfo> {
        let mut info = self.create_overlap_info();
        for table in tables {
            info.update(table);
        }
        let range = info.check_multiple_overlap(others);
        if range.is_empty() {
            vec![]
        } else {
            others[range].to_vec()
        }
    }
    fn check_overlap_with_tables(
        &self,
        tables: &[SstableInfo],
        others: &[SstableInfo],
    ) -> Vec<SstableInfo> {
        if tables.is_empty() || others.is_empty() {
            return vec![];
        }
        let mut info = self.create_overlap_info();
        for table in tables {
            info.update(table);
        }
        others
            .iter()
            .filter(|table| info.check_overlap(table))
            .cloned()
            .collect_vec()
    }

    fn create_overlap_info(&self) -> Box<dyn OverlapInfo>;
}

#[derive(Default, Debug)]
pub struct RangeOverlapInfo {
    target_range: Option<KeyRange>,
}

impl OverlapInfo for RangeOverlapInfo {
    fn check_overlap(&self, a: &SstableInfo) -> bool {
        match self.target_range.as_ref() {
            Some(range) => check_table_overlap(range, a),
            None => false,
        }
    }

    fn check_multiple_overlap(&self, others: &[SstableInfo]) -> Range<usize> {
        match self.target_range.as_ref() {
            Some(key_range) => {
                let overlap_begin = others.partition_point(|table_status| {
                    table_status.key_range.compare_right_with(&key_range.left)
                        == cmp::Ordering::Less
                });
                if overlap_begin >= others.len() {
                    return overlap_begin..overlap_begin;
                }
                let overlap_end = others.partition_point(|table_status| {
                    key_range.compare_right_with(&table_status.key_range.left)
                        != cmp::Ordering::Less
                });
                overlap_begin..overlap_end
            }
            None => others.len()..others.len(),
        }
    }

    fn check_multiple_include(&self, others: &[SstableInfo]) -> Range<usize> {
        match self.target_range.as_ref() {
            Some(key_range) => {
                let overlap_begin = others.partition_point(|table_status| {
                    KeyComparator::compare_encoded_full_key(
                        &table_status.key_range.left,
                        &key_range.left,
                    ) == cmp::Ordering::Less
                });
                if overlap_begin >= others.len() {
                    return overlap_begin..overlap_begin;
                }
                let mut overlap_end = overlap_begin;
                for table in &others[overlap_begin..] {
                    if key_range.compare_right_with(&table.key_range.right) == cmp::Ordering::Less {
                        break;
                    }
                    overlap_end += 1;
                }
                overlap_begin..overlap_end
            }
            None => others.len()..others.len(),
        }
    }

    fn update(&mut self, table: &SstableInfo) {
        let other = &table.key_range;
        if let Some(range) = self.target_range.as_mut() {
            range.full_key_extend(other);
            return;
        }
        self.target_range = Some(other.clone());
    }
}

#[derive(Default)]
pub struct RangeOverlapStrategy {}

impl OverlapStrategy for RangeOverlapStrategy {
    fn check_overlap(&self, a: &SstableInfo, b: &SstableInfo) -> bool {
        check_table_overlap(&a.key_range, b)
    }

    fn create_overlap_info(&self) -> Box<dyn OverlapInfo> {
        Box::<RangeOverlapInfo>::default()
    }
}

fn check_table_overlap(key_range: &KeyRange, table: &SstableInfo) -> bool {
    key_range.sstable_overlap(&table.key_range)
}