Search limits become product limits.
Search supplies the products used to generate a routine. If it considers too few, a useful option may never reach the model.
The PHP path reads stored vectors in batches, compares them, and sorts the scores. The pgvector path ranks inside the database and returns matching IDs before the application loads the selected products.
The application decides which products are eligible. The database ranks within that boundary. Faster ranking does not remove the need to choose the right candidates.