uqa-storage 0.4.6

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
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

use super::{
    identity::{row, Resolver},
    publication::{build, publish},
    setup, FIELD, TABLE,
};
use crate::diskann_index::{
    changes::{DiskANNPruneCursor, DiskANNPruneRequest, DiskANNPruneResult},
    format::{DiskANNChangeIdentity, DiskANNGeneration},
};
use crate::key_value::{
    conformance::{expect, expect_eq},
    vector_index::origin::journal,
    KeyValueDiskANNCanonical, KeyValueDiskANNPruner, KeyValueDiskANNStore,
    RetainedDiskANNCanonical,
};
use crate::{
    read_control::StorageReadControl, CatalogFacade, KeyValueCatalog, KeyValueStore,
    StorageBackendResult,
};
use std::sync::Arc;

fn prune(
    store: &Arc<dyn KeyValueStore>,
    source: &RetainedDiskANNCanonical,
    pruner: &KeyValueDiskANNPruner,
    request: DiskANNPruneRequest,
    control: &StorageReadControl,
) -> StorageBackendResult<DiskANNPruneResult> {
    let mut result = None;
    store.with_mutation(&mut |read, batch| {
        result = Some(source.prune_changes(&Resolver, pruner, (read, batch), request, control)?);
        Ok(())
    })?;
    result.ok_or_else(|| crate::StorageBackendError::Other("pruning callback did not run".into()))
}

fn page(max_records: usize) -> DiskANNPruneRequest {
    DiskANNPruneRequest {
        after: None,
        max_records,
    }
}

/// Actual bounded cleanup with late writers, obsolete/empty versions, savepoint undo, retained readers and head/catalog races. Supply a fresh disposable versioned database and close every owner before the reopen check.
pub fn verify_diskann_pruning(
    store: &Arc<dyn KeyValueStore>,
) -> StorageBackendResult<DiskANNGeneration> {
    let control = StorageReadControl::with_limit(1 << 20);
    let canonical = setup(store)?;
    KeyValueCatalog::new(store.clone()).save_catalog_index_row(&row([91; 16])?)?;
    let original = canonical.replace(1, &[vec![1.0, 0.0]], &control)?;
    canonical.replace(2, &[], &control)?;
    canonical.replace(3, &[], &control)?;
    canonical.replace(3, &[vec![0.0, 1.0]], &control)?;
    let peer = store.open_session()?;
    let peer_canonical = KeyValueDiskANNCanonical::new(peer.clone(), TABLE, FIELD, 2)?;
    peer.begin_transaction()?;
    let late = peer_canonical.replace(4, &[], &control)?;
    let repository = KeyValueDiskANNStore::connect(store, &control)?;
    repository.initialize(&control)?;
    let (coverage, stage) = build(&canonical, &repository, &control)?;
    publish(store, &coverage, &control)?;
    let pruner = KeyValueDiskANNPruner::open(
        repository.open_source(stage.generation(), &control)?,
        8192,
        &control,
    )?;
    let source = coverage.source();
    let changed = canonical.replace(1, &[vec![0.0, 1.0]], &control)?;
    peer.commit_transaction()?;
    let old_cursor = prune_pass(store, &canonical, source, &pruner, &control)?;
    expect_eq(
        &source.origin(1, &control)?,
        &Some(original),
        "old canonical origin survives cleanup",
    )?;
    expect_eq(
        &source
            .next_change_after(None, &control)?
            .map(DiskANNChangeIdentity::document),
        &Some(1),
        "old reader retains deleted journal entry",
    )?;
    let current = canonical.retain(&control)?;
    expect_eq(
        &current
            .next_change_after(None, &control)?
            .map(DiskANNChangeIdentity::version),
        &Some(changed),
        "current changed tensor remains journaled",
    )?;
    expect_eq(
        &current
            .next_change_after(Some(1), &control)?
            .map(DiskANNChangeIdentity::version),
        &Some(late),
        "earlier allocated later commit remains journaled",
    )?;
    publication_races(
        store,
        &canonical,
        source,
        &repository,
        &pruner,
        old_cursor,
        &control,
    )
}

fn prune_pass(
    store: &Arc<dyn KeyValueStore>,
    canonical: &KeyValueDiskANNCanonical,
    source: &RetainedDiskANNCanonical,
    pruner: &KeyValueDiskANNPruner,
    control: &StorageReadControl,
) -> StorageBackendResult<Option<DiskANNPruneCursor>> {
    let prefix = journal::prefix(TABLE, FIELD)?;
    expect_eq(
        &store.scan_prefix(&prefix)?.len(),
        &6,
        "six actual journal mutations",
    )?;
    store.begin_transaction()?;
    store.savepoint("pruning")?;
    expect_eq(
        &prune(store, source, pruner, page(64), control)?.removed,
        &4,
        "covered and obsolete versions staged",
    )?;
    store.rollback_to_savepoint("pruning")?;
    expect_eq(
        &store.scan_prefix(&prefix)?.len(),
        &6,
        "pruning undo restores every journal entry",
    )?;
    canonical.replace(1, &[], control)?;
    expect(
        prune(store, source, pruner, page(64), control).is_err(),
        "private input cannot authorize pruning",
    )?;
    store.rollback_transaction()?;
    expect(
        prune(store, source, pruner, page(0), control).is_err(),
        "zero page rejected",
    )?;
    expect(
        prune(
            store,
            source,
            pruner,
            page(64),
            &StorageReadControl::with_limit(1),
        )
        .is_err(),
        "quota rejects before deletion",
    )?;
    let mut request = page(1);
    let mut examined = 0;
    let mut removed = 0;
    let old_cursor;
    loop {
        let result = prune(store, source, pruner, request, control)?;
        expect(
            result.examined <= 1 && result.removed <= 1,
            "bounded exact-key page",
        )?;
        examined += result.examined;
        removed += result.removed;
        if result.next.is_none() {
            old_cursor = request.after;
            break;
        }
        request.after = result.next;
    }
    expect_eq(
        &(examined, removed),
        &(6, 4),
        "one pass covers all versions and preserves late changes",
    )?;
    Ok(old_cursor)
}

fn publication_races(
    store: &Arc<dyn KeyValueStore>,
    canonical: &KeyValueDiskANNCanonical,
    source: &RetainedDiskANNCanonical,
    repository: &KeyValueDiskANNStore,
    pruner: &KeyValueDiskANNPruner,
    old_cursor: Option<DiskANNPruneCursor>,
    control: &StorageReadControl,
) -> StorageBackendResult<DiskANNGeneration> {
    let peer = store.open_session()?;
    let prefix = journal::prefix(TABLE, FIELD)?;
    let obsolete = canonical.replace(0, &[], control)?;
    canonical.replace(0, &[], control)?;
    expect_eq(
        &prune(
            store,
            source,
            pruner,
            DiskANNPruneRequest {
                after: old_cursor,
                max_records: 64,
            },
            control,
        )?
        .examined,
        &0,
        "new earlier keys do not redefine a completed cursor",
    )?;
    let (new_coverage, new_stage) = build(canonical, repository, control)?;
    store.begin_transaction()?;
    expect_eq(
        &prune(store, source, pruner, page(64), control)?.removed,
        &1,
        "fresh pass discovers earlier obsolete key",
    )?;
    publish(&peer, &new_coverage, control)?;
    expect(
        store.commit_transaction().is_err(),
        "head switch rejects evaluated cleanup",
    )?;
    store.rollback_transaction()?;
    expect(
        store
            .get(&journal::key(
                TABLE,
                FIELD,
                DiskANNChangeIdentity::new(0, obsolete),
            )?)?
            .is_some(),
        "failed cleanup publishes no deletion",
    )?;
    expect(
        prune(store, source, pruner, page(64), control).is_err(),
        "retired coverage cannot prune new head",
    )?;
    let pruner = KeyValueDiskANNPruner::open(
        repository.open_source(new_stage.generation(), control)?,
        8192,
        control,
    )?;
    expect(
        prune(
            store,
            source,
            &pruner,
            DiskANNPruneRequest {
                after: old_cursor,
                max_records: 64,
            },
            control,
        )
        .is_err(),
        "cursor belongs to its original generation",
    )?;
    store.begin_transaction()?;
    prune(store, source, &pruner, page(64), control)?;
    KeyValueCatalog::new(peer).save_catalog_index_row(&row([91; 16])?)?;
    expect(
        store.commit_transaction().is_err(),
        "catalog change rejects evaluated cleanup",
    )?;
    store.rollback_transaction()?;
    let fresh = canonical.retain_for_index(&row([91; 16])?.relation, control)?;
    malformed_and_controls(store, &fresh, &pruner, control)?;
    canonical.replace(9, &[], control)?;
    expect_eq(
        &prune(store, &fresh, &pruner, page(64), control)?.removed,
        &4,
        "new published coverage retires exact current and obsolete records",
    )?;
    expect_eq(
        &store.scan_prefix(&prefix)?.len(),
        &1,
        "only post-build mutation remains",
    )?;
    Ok(new_stage.generation())
}

fn malformed_and_controls(
    store: &Arc<dyn KeyValueStore>,
    source: &RetainedDiskANNCanonical,
    pruner: &KeyValueDiskANNPruner,
    control: &StorageReadControl,
) -> StorageBackendResult<()> {
    let keys = store.scan_prefix(&journal::prefix(TABLE, FIELD)?)?;
    let (key, value) = keys.last().expect("fixture has late changes");
    store.put(key, b"bad journal origin")?;
    expect(
        prune(store, source, pruner, page(64), control).is_err(),
        "corrupt late record fails whole pruning batch",
    )?;
    expect_eq(
        &store.scan_prefix(&journal::prefix(TABLE, FIELD)?)?.len(),
        &keys.len(),
        "earlier evaluated deletes roll back on decoding failure",
    )?;
    store.put(key, value)?;
    let cancelled = StorageReadControl::with_limit(1 << 20);
    cancelled.cancellation().cancel();
    expect(
        prune(store, source, pruner, page(64), &cancelled).is_err(),
        "cancelled pruning preserves journal",
    )
}

/// Verify selected coverage and the sole uncovered mutation after every provider owner has closed.
pub fn verify_diskann_pruning_reopen(
    store: &Arc<dyn KeyValueStore>,
    generation: DiskANNGeneration,
) -> StorageBackendResult<()> {
    let control = StorageReadControl::with_limit(1 << 20);
    let canonical = KeyValueDiskANNCanonical::new(store.clone(), TABLE, FIELD, 2)?;
    let source = canonical.retain_for_index(&row([91; 16])?.relation, &control)?;
    let repository = KeyValueDiskANNStore::connect(store, &control)?;
    let pruner = KeyValueDiskANNPruner::open(
        repository.open_source(generation, &control)?,
        8192,
        &control,
    )?;
    let result = prune(store, &source, &pruner, page(64), &control)?;
    expect_eq(
        &(result.examined, result.removed, result.next),
        &(1, 0, None),
        "cold reopen preserves uncovered journal",
    )?;
    expect_eq(
        &source
            .next_change_after(None, &control)?
            .map(DiskANNChangeIdentity::document),
        &Some(9),
        "reopened changed-document query",
    )?;
    expect_eq(
        &store.scan_prefix(&journal::prefix(TABLE, FIELD)?)?.len(),
        &1,
        "cold reopen retains bounded physical deletion",
    )?;
    finite_discovery(store, &control)?;
    clear_racing_pruning(store, &control)
}

fn clear_racing_pruning(
    store: &Arc<dyn KeyValueStore>,
    control: &StorageReadControl,
) -> StorageBackendResult<()> {
    use crate::{diskann_index::build::DiskANNTemporaryBudget, VectorIndex};
    let temporary = DiskANNTemporaryBudget::new(1 << 20);
    let canonical = KeyValueDiskANNCanonical::new(store.clone(), TABLE, FIELD, 2)?;
    for refresh in [false, true] {
        canonical.replace(0, &[], control)?;
        canonical.replace(0, &[], control)?;
        let peer = store.open_controlled_session(control)?;
        let pruner = KeyValueDiskANNCanonical::new(peer.clone(), TABLE, FIELD, 2)?.journal_pruner(
            &row([91; 16])?.relation,
            Arc::new(Resolver),
            8192,
            control,
        )?;
        let mut index = super::runtime::runtime(store, &temporary, control)?;
        let retained = index.snapshot()?;
        let previous_count = retained.count()?;
        store.begin_transaction()?;
        index.clear()?;
        peer.begin_transaction()?;
        expect(
            pruner.prune(page(64), control)?.removed > 0,
            "peer pruned an evaluated clear key",
        )?;
        peer.commit_transaction()?;
        if refresh {
            store.refresh_transaction_snapshot(control.cancellation())?;
        }
        store.commit_transaction()?;
        expect_eq(&index.count()?, &0, "clear commits after journal pruning")?;
        expect_eq(
            &retained.count()?,
            &previous_count,
            "clear preserves retained canonical data",
        )?;
        expect(
            store
                .scan_prefix(&journal::prefix(TABLE, FIELD)?)?
                .is_empty(),
            "clear removes the remaining journal",
        )?;
    }
    Ok(())
}

fn finite_discovery(
    store: &Arc<dyn KeyValueStore>,
    control: &StorageReadControl,
) -> StorageBackendResult<()> {
    controlled_session(store, control)?;
    let original = StorageReadControl::new(control.memory(), &uqa_core::CancellationToken::new());
    let pruner = KeyValueDiskANNCanonical::new(store.clone(), TABLE, FIELD, 2)?.journal_pruner(
        &row([91; 16])?.relation,
        Arc::new(Resolver),
        8192,
        &original,
    )?;
    expect(
        pruner.prune(page(64), control).is_err(),
        "finite journal page requires caller transaction",
    )?;
    let canonical = KeyValueDiskANNCanonical::new(store.clone(), TABLE, FIELD, 2)?;
    let retained = canonical.retain(control)?;
    canonical.replace(9, &[], control)?;
    store.begin_transaction()?;
    let result = pruner.prune(page(64), control)?;
    expect_eq(
        &(result.examined, result.removed, result.next),
        &(1, 1, None),
        "finite discovery excludes new keys and rechecks current obsolescence",
    )?;
    store.commit_transaction()?;
    expect_eq(
        &store.scan_prefix(&journal::prefix(TABLE, FIELD)?)?.len(),
        &1,
        "uncovered replacement survives finite pruning",
    )?;
    expect(
        retained.next_change_after(None, control)?.is_some(),
        "older reader preserves removed history",
    )?;
    original.cancellation().cancel();
    store.begin_transaction()?;
    expect(
        pruner.prune(page(64), control).is_err(),
        "finite discovery retains original cancellation",
    )?;
    store.rollback_transaction()
}

fn controlled_session(
    store: &Arc<dyn KeyValueStore>,
    control: &StorageReadControl,
) -> StorageBackendResult<()> {
    let control = StorageReadControl::new(control.memory(), &uqa_core::CancellationToken::new());
    let sibling = store.open_controlled_session(&control)?;
    let retained = sibling
        .retention_control()
        .expect("controlled session exposes allowance");
    expect(
        retained.memory().shares_allowance(control.memory()),
        "independent maintenance uses original allowance",
    )?;
    let before = control.memory().used();
    sibling.begin_transaction()?;
    sibling.put(b"diskann-maintenance-budget-probe", &[7; 1024])?;
    expect(
        control.memory().used() > before,
        "private maintenance writes charge original allowance",
    )?;
    let held = control
        .memory()
        .reserve(control.memory().limit() - control.memory().used())?;
    expect(
        sibling
            .put(b"diskann-maintenance-budget-second", &[7; 1024])
            .is_err(),
        "maintenance cannot escape an exhausted allowance",
    )?;
    drop(held);
    control.cancellation().cancel();
    sibling.rollback_transaction()?;
    expect(
        store.get(b"diskann-maintenance-budget-probe")?.is_none(),
        "cancelled maintenance rolls back only its own writes",
    )
}