Skip to main content

PgSparseVectorIndex

Struct PgSparseVectorIndex 

Source
pub struct PgSparseVectorIndex { /* private fields */ }
Expand description

PostgreSQL sparse vector index — the lexical half of hybrid retrieval.

Stores sparsevec(N) rows (N = vocabulary size, e.g. 250 002 for BGE-M3’s XLM-R vocabulary) and ranks by inner product, which is how learned-lexical weights (BGE-M3 sparse, SPLADE) are scored. Deliberately not an AsyncVectorIndex — that trait speaks dense Vec<f32>. Pair it with a PgVectorIndex and combine the two result lists with Fusion.

Requires the pgvector extension ≥ 0.7 (sparsevec + sparsevec_ip_ops). pgvector caps the number of non-zero elements it will index, so prune long lexical vectors with SparseVector::prune_top_k before inserting.

Implementations§

Source§

impl PgSparseVectorIndex

Source

pub async fn new(url: &str, table: &str, dim: usize) -> Result<Self>

Connect and create the sparsevec table + HNSW inner-product index.

dim is the vocabulary size and is enforced by the sparsevec(dim) column; vectors carrying an index ≥ dim are rejected on insert.

Source

pub fn dim(&self) -> usize

Vocabulary size of the indexed vectors.

Source

pub fn pool(&self) -> &PgPool

Underlying connection pool — see PgVectorIndex::pool.

Source

pub async fn add(&self, vectors: &[SparseVector], ids: &[u64]) -> Result<()>

Upsert sparse vectors by external ID.

Source

pub async fn search( &self, query: &SparseVector, k: usize, ) -> Result<Vec<SearchHit>>

Top-k by inner product. An empty query matches nothing by definition (its inner product with every row is zero), so it short-circuits.

Source

pub async fn search_filtered( &self, query: &SparseVector, k: usize, allowlist: &[u64], ) -> Result<Vec<SearchHit>>

Top-k by inner product, restricted to allowlist.

Source

pub async fn remove(&self, ids: &[u64]) -> Result<()>

Remove vectors by external ID.

Source

pub async fn remove_in_tx( &self, tx: &mut PgConnection, ids: &[u64], ) -> Result<()>

Remove within a caller-provided transaction — see PgVectorIndex::remove_in_tx. Lets a dense index, a sparse index and the caller’s own tables be pruned atomically together.

Source

pub async fn len(&self) -> Result<usize>

Number of stored vectors.

Source

pub async fn is_empty(&self) -> Result<bool>

Whether the index holds no vectors.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> IntoRequest<T> for T

Source§

fn into_request(self) -> Request<T>

Wrap the input message T in a tonic::Request
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more