uqa-execution 0.4.9

Volcano physical operators with row-batch pipelines
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

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

use std::cell::Cell;

use uqa_sql::ast::TableKeyConstraintKind;

use super::*;

fn constraint(column: &str) -> TableKeyConstraint {
    TableKeyConstraint {
        catalog_identity: None,
        name: Some(format!("{column}_key")),
        kind: TableKeyConstraintKind::Unique,
        columns: vec![column.to_owned()],
        included_columns: Vec::new(),
        nulls_not_distinct: false,
        without_overlaps: false,
    }
}

fn key(constraint: TableKeyConstraint, ancestors: Vec<[u8; 16]>) -> EnforcedKey {
    EnforcedKey {
        constraint,
        keys: Vec::new(),
        index: None,
        index_catalog: None,
        index_ancestors: ancestors,
        predicate: None,
        constraint_owned: true,
    }
}

/// The names of the keys found, and how many times they were looked for.
fn names(
    cache: &EnforcedKeyCache,
    table: &str,
    constraints: &[TableKeyConstraint],
    indexes: &Arc<IndexRows>,
    lookups: &Cell<usize>,
) -> Vec<String> {
    cache
        .keys(table, constraints.to_vec(), indexes, |constraints| {
            lookups.set(lookups.get() + 1);
            Ok(constraints
                .into_iter()
                .map(|constraint| key(constraint, Vec::new()))
                .collect())
        })
        .unwrap()
        .into_iter()
        .map(|key| key.constraint.name.unwrap())
        .collect()
}

#[test]
fn keys_are_found_once_for_the_same_constraints_and_index_rows() {
    let cache = EnforcedKeyCache::default();
    let indexes = Arc::new(IndexRows::new());
    let lookups = Cell::new(0);
    let first = [constraint("a")];
    assert_eq!(
        names(&cache, "public.t", &first, &indexes, &lookups),
        ["a_key"]
    );
    assert_eq!(
        names(&cache, "public.t", &first, &indexes, &lookups),
        ["a_key"]
    );
    assert_eq!(lookups.get(), 1);
    // Another table with the same constraints has its own keys.
    assert_eq!(
        names(&cache, "public.u", &first, &indexes, &lookups),
        ["a_key"]
    );
    assert_eq!(lookups.get(), 2);
    // A changed constraint, and index rows that are another object, are looked up again.
    let second = [constraint("a"), constraint("b")];
    assert_eq!(
        names(&cache, "public.t", &second, &indexes, &lookups),
        ["a_key", "b_key"]
    );
    assert_eq!(lookups.get(), 3);
    let republished = Arc::new(IndexRows::new());
    assert_eq!(
        names(&cache, "public.t", &second, &republished, &lookups),
        ["a_key", "b_key"]
    );
    assert_eq!(lookups.get(), 4);
    assert_eq!(
        names(&cache, "public.t", &second, &republished, &lookups),
        ["a_key", "b_key"]
    );
    assert_eq!(lookups.get(), 4);
    // The earlier inputs of the same table were replaced, not kept beside the new ones.
    assert_eq!(
        names(&cache, "public.t", &first, &indexes, &lookups),
        ["a_key"]
    );
    assert_eq!(lookups.get(), 5);
    assert_eq!(cache.entries.lock().len(), 2);
}

#[test]
fn the_keys_of_a_partition_index_and_failed_lookups_are_not_kept() {
    let cache = EnforcedKeyCache::default();
    let indexes = Arc::new(IndexRows::new());
    let lookups = Cell::new(0);
    for _ in 0..2 {
        let keys = cache
            .keys(
                "public.part",
                vec![constraint("a")],
                &indexes,
                |constraints| {
                    lookups.set(lookups.get() + 1);
                    Ok(constraints
                        .into_iter()
                        .map(|constraint| key(constraint, vec![[7; 16]]))
                        .collect())
                },
            )
            .unwrap();
        assert_eq!(keys[0].index_ancestors, [[7; 16]]);
    }
    assert_eq!(lookups.get(), 2);
    for _ in 0..2 {
        assert!(cache
            .keys("public.broken", Vec::new(), &indexes, |_| {
                lookups.set(lookups.get() + 1);
                Err(uqa_storage::StorageBackendError::Other("no catalog".into()))
            })
            .is_err());
    }
    assert_eq!(lookups.get(), 4);
    assert!(cache.entries.lock().is_empty());
}

#[test]
fn the_oldest_table_makes_room() {
    let cache = EnforcedKeyCache::default();
    let indexes = Arc::new(IndexRows::new());
    let lookups = Cell::new(0);
    for table in 0..=TABLES {
        names(&cache, &format!("public.t{table}"), &[], &indexes, &lookups);
    }
    assert_eq!(cache.entries.lock().len(), TABLES);
    names(&cache, "public.t0", &[], &indexes, &lookups);
    assert_eq!(lookups.get(), TABLES + 2);
    names(
        &cache,
        &format!("public.t{TABLES}"),
        &[],
        &indexes,
        &lookups,
    );
    assert_eq!(lookups.get(), TABLES + 2);
}