coordinode-lsm-tree 7.6.0

Embedded LSM-tree storage engine in pure Rust, no C/C++ dependency. MVCC snapshots, BuRR filters, zstd dictionary compression, columnar PAX blocks, AES-256-GCM at rest, self-healing per-block ECC, compaction on a near-full disk, no_std support.
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

// SPDX-License-Identifier: Apache-2.0
// Copyright (c) 2026-present, Dmitry Prudnikov

use super::*;

fn inputs(scan_share: f64, merge_secs: f64) -> Inputs {
    Inputs {
        round: 16,
        size_ratio: 3,
        arrival_secs: 10.0,
        merge_secs,
        merge_query_share: 0.5,
        scan_share,
        false_positive_rate: 0.01,
    }
}

/// The units merged after each of the round's arrivals.
fn merges(plan: &Plan) -> Vec<u32> {
    (1..=16).map(|t| plan.merge_after(t)).collect()
}

/// Without scans the number of runs costs a query nothing: no merge pays,
/// and none is planned.
#[test]
fn without_scans_nothing_is_merged() {
    let plan = Plan::solve(&inputs(0.0, 0.1));
    assert!(merges(&plan).iter().all(|&units| units == 1), "{plan:?}");
}

/// Cheap merges and scans that pay for every run make the plan merge, and
/// merge early in the round, where a merge serves the most queries.
#[test]
fn cheap_merges_under_scans_are_planned_early() {
    let plan = Plan::solve(&inputs(0.5, 0.1));
    let merges = merges(&plan);
    let first = merges
        .iter()
        .position(|&units| units > 1)
        .expect("a merge is planned");
    assert!(first < 8, "the first merge comes early: {merges:?}");
}

/// When scans are rare a run costs a query little, and a merge costs more
/// queries than it frees: none is planned.
#[test]
fn merges_dearer_than_their_benefit_are_not_planned() {
    let plan = Plan::solve(&inputs(0.001, 5.0));
    assert!(merges(&plan).iter().all(|&units| units == 1), "{plan:?}");
}

/// The global merge ending the round takes longer the more it merges, and
/// the queries running meanwhile are faster over fewer runs: even dear
/// merges pay once, just before the round ends, when scans are common.
#[test]
fn a_dear_merge_pays_before_a_long_global_merge() {
    let plan = Plan::solve(&inputs(0.5, 1_000.0));
    let merges = merges(&plan);
    assert!(
        merges.iter().take(14).all(|&units| units == 1),
        "{merges:?}"
    );
    assert!(merges.iter().any(|&units| units > 1), "{merges:?}");
}

/// The same inputs give the same plan, solved apart.
#[test]
fn the_plan_is_the_same_for_the_same_inputs() {
    let a = Plan::solve(&inputs(0.3, 1.0));
    let b = Plan::solve(&inputs(0.3, 1.0));
    assert_eq!(a, b);
}

/// Past the round, nothing is merged.
#[test]
fn nothing_is_merged_past_the_round() {
    let plan = Plan::solve(&inputs(0.5, 0.1));
    assert_eq!(plan.merge_after(17), 1);
    assert_eq!(plan.merge_after(u32::MAX), 1);
}