docs/documentation/vector/tuning.mdx
Vector search is approximate: it probes a subset of the index's vector clusters rather than scanning every vector. Probing more clusters improves recall (i.e. how often the true nearest neighbors are returned) at the cost of higher latency. One session-level setting controls this tradeoff:
SET paradedb.vector_cluster_max_probe = 0.02;
Within the ceiling, clusters that provably cannot improve the current top-K are skipped automatically using per-cluster bounds stored in the index; this skipping never reduces recall, so raising the ceiling only ever improves it.
</ParamField> <Note> Recall also depends on the index's `centroid_ratio`, set at build time. See [Index Options](/documentation/indexing/indexing-vectors#index-options). </Note>