coordinode-lsm-tree 4.2.0

A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs) — CoordiNode fork
Documentation 
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

// Copyright (c) 2024-present, fjall-rs
// This source code is licensed under both the Apache 2.0 and MIT License
// (found in the LICENSE-* files in the repository)

use super::{Choice, CompactionStrategy, Input as CompactionInput};
use crate::{
    HashSet, compaction::state::CompactionState, config::Config, table::Table, version::Version,
};

/// Compacts all tables into the last level
pub struct Strategy {
    target_size: u64,
}

impl Strategy {
    /// Configures a new `Major` compaction strategy.
    #[must_use]
    pub fn new(target_size: u64) -> Self {
        Self { target_size }
    }
}

impl Default for Strategy {
    fn default() -> Self {
        Self {
            target_size: u64::MAX,
        }
    }
}

impl CompactionStrategy for Strategy {
    fn get_name(&self) -> &'static str {
        "MajorCompaction"
    }

    fn choose(&self, version: &Version, cfg: &Config, state: &CompactionState) -> Choice {
        let table_ids: HashSet<_> = version.iter_tables().map(Table::id).collect();

        // NOTE: This should generally not occur because of the
        // tree-level major compaction lock
        // But just as a fail-safe...
        let some_hidden = table_ids.iter().any(|&id| state.hidden_set().is_hidden(id));

        if some_hidden {
            Choice::DoNothing
        } else {
            let last_level_idx = cfg.level_count - 1;

            Choice::Merge(CompactionInput {
                table_ids,
                dest_level: last_level_idx,
                canonical_level: last_level_idx,
                target_size: self.target_size,
            })
        }
    }
}