docs/changelog/0.25.1.mdx
Vector search now uses a proof-based bounds gate with a work budget, which skips clusters that provably cannot contribute to the result. This cuts tail latency by up to 6x and produces much tighter recall/latency confidence intervals.
Because the gate is proof-based, there is no longer a recall knob to misconfigure: paradedb.vector_cluster_max_probe,
the work-budget ceiling, is now the only recall/latency setting.
Tiebreaker columns can now follow the distance in ORDER BY, making vector search results deterministic
when embeddings are equidistant from the query vector:
SELECT id, description
FROM mock_items
WHERE id @@@ pdb.all()
ORDER BY embedding <=> '[1, 2, 3, 4, 5, 6, 7, 8]', id
LIMIT 5;
The vector arm of reciprocal rank fusion queries is now pushed down into the ParadeDB index, accelerating hybrid search.
The ParadeDB ORM integrations have been updated for the paradedb index naming, native vector search, and the
vector index build options:
0.10.00.12.00.11.00.4.00.3.0JoinScan now supports LEFT, RIGHT, and FULL joins, extending the join shapes that execute inside the
ParadeDB index.
paradedb.vector_clustering_threshold GUC (default 500) sets the segment size at which vector storage
switches from flat to clustered.datetime_fields error.pg_search's non-base shared libraries.partition_by and sort_by.The full changelog is available on the GitHub Release.