iridium-db 0.4.0

A high-performance vector-graph hybrid storage and indexing engine
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

use super::*;

fn open(base: &std::path::Path) -> StorageHandle {
    open_store(StorageConfig {
        buffer_pool_pages: 8,
        wal_dir: base.join("wal"),
        wal_segment_max_bytes: 1 << 20,
        manifest_path: base.join("ir.manifest"),
        sstable_dir: base.join("sst"),
    })
    .unwrap()
}

/// Two cosine spaces with different dimensions: dimension filter routes to the matching space.
#[test]
fn ann_space_for_query_routes_by_dimension() {
    let base = temp_dir("ann_route_by_dim");
    let mut handle = open(&base);

    let space2d = 10_u32;
    let space3d = 11_u32;

    for i in 1..=5_u64 {
        put_full_node(&mut handle, i, 1, &[]).unwrap();
        let payload =
            encode_vector_payload_f32(space2d, VectorMetric::Cosine, &[i as f32, 0.0], false);
        put_vector_delta(&mut handle, &encode_delta(i, 2, &payload)).unwrap();
    }

    for i in 6..=10_u64 {
        put_full_node(&mut handle, i, 1, &[]).unwrap();
        let payload =
            encode_vector_payload_f32(space3d, VectorMetric::Cosine, &[i as f32, 0.0, 0.0], false);
        put_vector_delta(&mut handle, &encode_delta(i, 2, &payload)).unwrap();
    }

    let routed = ann_space_for_query(&handle, VectorMetric::Cosine, Some(2));
    assert_eq!(
        routed,
        Some(space2d),
        "dim=2 query must route to space {space2d}"
    );

    let routed = ann_space_for_query(&handle, VectorMetric::Cosine, Some(3));
    assert_eq!(
        routed,
        Some(space3d),
        "dim=3 query must route to space {space3d}"
    );
}

/// Two cosine spaces with the same dimension and no dim filter: selects the larger graph.
#[test]
fn ann_space_for_query_selects_largest_graph_when_ambiguous() {
    let base = temp_dir("ann_select_largest");
    let mut handle = open(&base);

    let space_small = 20_u32;
    let space_large = 21_u32;

    for i in 1..=2_u64 {
        put_full_node(&mut handle, i, 1, &[]).unwrap();
        let payload =
            encode_vector_payload_f32(space_small, VectorMetric::Cosine, &[i as f32, 0.0], false);
        put_vector_delta(&mut handle, &encode_delta(i, 2, &payload)).unwrap();
    }

    for i in 3..=12_u64 {
        put_full_node(&mut handle, i, 1, &[]).unwrap();
        let payload =
            encode_vector_payload_f32(space_large, VectorMetric::Cosine, &[i as f32, 0.0], false);
        put_vector_delta(&mut handle, &encode_delta(i, 2, &payload)).unwrap();
    }

    let routed = ann_space_for_query(&handle, VectorMetric::Cosine, None);
    assert_eq!(
        routed,
        Some(space_large),
        "must select the larger graph when dimension is ambiguous"
    );
}

/// When a sibling HNSW graph is empty (all vectors rebuilt away), routing must skip it
/// and return the populated space rather than short-circuiting to None.
#[test]
fn ann_space_for_query_skips_empty_sibling_graph() {
    let base = temp_dir("ann_skip_empty_sibling");
    let mut handle = open(&base);

    let space_live = 30_u32;
    let space_drained = 31_u32;

    for i in 1..=3_u64 {
        put_full_node(&mut handle, i, 1, &[]).unwrap();
        let payload =
            encode_vector_payload_f32(space_live, VectorMetric::Cosine, &[i as f32, 0.0], false);
        put_vector_delta(&mut handle, &encode_delta(i, 2, &payload)).unwrap();
    }

    // Populate space_drained, tombstone all its nodes, then rebuild — leaving an empty graph.
    for i in 10..=11_u64 {
        put_full_node(&mut handle, i, 1, &[]).unwrap();
        let payload =
            encode_vector_payload_f32(space_drained, VectorMetric::Cosine, &[i as f32, 0.0], false);
        put_vector_delta(&mut handle, &encode_delta(i, 2, &payload)).unwrap();
    }
    put_tombstone(&mut handle, 10, 3).unwrap();
    put_tombstone(&mut handle, 11, 3).unwrap();
    rebuild_vector_space(&mut handle, space_drained).unwrap();

    // hnsw_graphs now contains space_live (2 dims, populated) and space_drained (empty).
    // Routing must not short-circuit to None due to the empty graph.
    let routed = ann_space_for_query(&handle, VectorMetric::Cosine, Some(2));
    assert_eq!(
        routed,
        Some(space_live),
        "must skip empty sibling graph and route to space with live vectors"
    );
}