uqa-storage-sqlite 0.4.8

SQLite catalog, indexes, compressed storage, graph and key/value providers
Documentation
//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

//! Read-only IVF query path.

use uqa_core::PostingList;

use super::SQLiteIVFIndex;
use uqa_storage::ivf_index::IVFState;
use uqa_storage::vector_index::query::{nearest_centroids, scored_posting_list};
use uqa_storage::vector_index::VectorIndex;
use uqa_storage::StorageBackendResult;

impl SQLiteIVFIndex {
    pub(super) fn search_top_k(
        &self,
        query: &[f32],
        k: usize,
    ) -> StorageBackendResult<PostingList> {
        self.persistent.validate_dimensions(query)?;
        if k == 0 {
            return Ok(PostingList::new());
        }
        if let Some(result) = self
            .persistent
            .read_native(|read| self.search_native(read, query, k))?
        {
            return Ok(result);
        }
        let Some(meta) = self.ready_meta()? else {
            return self.persistent.search_knn(query, k);
        };
        if meta.state != IVFState::Trained {
            return self.persistent.search_knn(query, k);
        }
        let centroids = self.load_centroids()?;
        if centroids.is_empty() {
            return self.persistent.search_knn(query, k);
        }
        let probes = nearest_centroids(query, &centroids, self.params.nprobe, None)?;
        let candidates = self.load_candidates(&probes)?;
        if candidates.is_empty() {
            return Ok(PostingList::new());
        }
        scored_posting_list(
            query,
            candidates
                .iter()
                .map(|(doc, vector)| (*doc, vector.as_slice())),
            k,
            None,
        )
    }
}