uqa-planner 0.4.8

Cost model, cardinality, DPccp join enumeration, optimizer rewrites
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

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

use super::vector_statistics;
use crate::retrieval_planning::VectorStatisticsRead;
use std::cell::Cell;
use uqa_core::{DiskANNQueryStats, IndexStats};
use uqa_sql::SQLError;

struct Vectors(Cell<usize>);

impl VectorStatisticsRead for Vectors {
    fn dimensions(&self, field: &str) -> Option<u32> {
        (field == "embedding").then_some(2)
    }

    fn diskann_query_statistics(
        &self,
        field: &str,
        query: &[f32],
    ) -> Result<Option<DiskANNQueryStats>, SQLError> {
        assert_eq!(field, "embedding");
        assert_eq!(query, [f32::MAX, 0.0]);
        self.0.set(self.0.get() + 1);
        Ok(None)
    }
}

#[test]
fn physical_vector_cost_inputs_preserve_execution_validation() {
    let vectors = Vectors(Cell::new(0));
    let mut stats = IndexStats::new(1);
    for query in [
        vec![],
        vec![1.0],
        vec![1.0, 0.0, 0.0],
        vec![f32::NAN, 0.0],
        vec![f32::INFINITY, 0.0],
        vec![f32::NEG_INFINITY, 0.0],
    ] {
        vector_statistics(&vectors, &mut stats, vec![("embedding".into(), query)]).unwrap();
    }
    vector_statistics(
        &vectors,
        &mut stats,
        vec![("missing".into(), vec![1.0, 0.0])],
    )
    .unwrap();
    assert_eq!(vectors.0.get(), 0);
    assert_eq!(stats.dimensions, 3);
    // Finite coordinates with an overflowing norm must still reach Storage's numeric-route classification.
    vector_statistics(
        &vectors,
        &mut stats,
        vec![("embedding".into(), vec![f32::MAX, 0.0])],
    )
    .unwrap();
    assert_eq!(vectors.0.get(), 1);
}