uqa-storage 0.1.11

Document store, inverted index, IVF/HNSW vectors, B-tree, R*Tree, catalog
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

//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

use std::collections::BTreeMap;

use super::{HNSWIndexParams, IVFIndexParams};

#[test]
fn parses_independent_ivf_and_hnsw_parameters() {
    let ivf = IVFIndexParams::from_catalog_map(&BTreeMap::from([
        ("lists".into(), "32".into()),
        ("probes".into(), "4".into()),
    ]))
    .unwrap();
    assert_eq!(ivf.nlist, 32);
    assert_eq!(ivf.nprobe, 4);

    let hnsw = HNSWIndexParams::from_catalog_map(&BTreeMap::from([
        ("m".into(), "12".into()),
        ("ef_construction".into(), "96".into()),
        ("ef_search".into(), "48".into()),
    ]))
    .unwrap();
    assert_eq!(hnsw.m, 12);
    assert_eq!(hnsw.ef_construction, 96);
    assert_eq!(hnsw.ef_search, 48);
}

#[test]
fn rejects_invalid_hnsw_graph_bounds() {
    let error = HNSWIndexParams::from_catalog_map(&BTreeMap::from([
        ("m".into(), "16".into()),
        ("ef_construction".into(), "8".into()),
    ]))
    .unwrap_err();
    assert!(error.to_string().contains("ef_construction"));
}

#[test]
fn rejects_cross_algorithm_and_duplicate_catalog_parameters() {
    let cross = HNSWIndexParams::from_catalog_map(&BTreeMap::from([("lists".into(), "8".into())]))
        .unwrap_err();
    assert!(cross.to_string().contains("unsupported"));

    let duplicate = IVFIndexParams::from_catalog_map(&BTreeMap::from([
        ("lists".into(), "8".into()),
        ("nlist".into(), "16".into()),
    ]))
    .unwrap_err();
    assert!(duplicate.to_string().contains("duplicate"));
}