uqa-planner 0.3.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

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

//! Plan physical text limits from one retained analyzer/index-statistics snapshot.

use super::RetrievalPlanningCatalog;
use uqa_operators::{OperatorTree, TextScoringMode};
use uqa_sql::SQLError;

#[cfg(test)]
mod tests;

pub fn plan_text_top_k_tree(
    catalog: &dyn RetrievalPlanningCatalog,
    table: &str,
    field: &str,
    query: &str,
    scoring: TextScoringMode,
    top_k: usize,
) -> Result<OperatorTree, SQLError> {
    let capabilities = catalog.text_top_k_capabilities(table, field, query)?;
    Ok(crate::plan_text_top_k(
        OperatorTree::Term {
            query: query.to_string(),
            field: Some(field.to_string()),
            scoring: Some(scoring),
            top_k: None,
        },
        top_k,
        capabilities,
    ))
}

pub fn plan_bound_text_top_k(
    catalog: &dyn RetrievalPlanningCatalog,
    table: &str,
    tree: uqa_operators::OperatorTree,
    top_k: usize,
) -> Result<uqa_operators::OperatorTree, SQLError> {
    let (query, field, scoring) = match tree {
        uqa_operators::OperatorTree::Term {
            query,
            field: Some(field),
            scoring: Some(scoring),
            top_k: None,
        } => (query, field, scoring),
        other => return Ok(other),
    };
    plan_text_top_k_tree(catalog, table, &field, &query, scoring, top_k)
}