The first move when vector search latency spikes under load is to reduce top_k and stop returning full listing text before blaming the index. Short answer: in a property-management aggregator, every extra hit multiplies description and source metadata carried through the network and decoded by the Go service; measure each query shape separately, keep only identifiers plus compact citation metadata in the index, and hydrate selected records from the system of record.
This is an architecture decision. A response that cannot identify its source is unusable for listing reconciliation, while one that returns every source document in full makes tail latency and downstream work grow with k .
How should you debug vector search latency spikes under load?
The first invariant is grounding: every candidate needs enough stable metadata to trace it to the originating listing source. The second is bounded amplification: response bytes must grow with compact candidate records, not full chunk text.…