benwtrent opened a new issue, #15154:
URL: https://github.com/apache/lucene/issues/15154
### Description
Since the vector reordering attempts to sort vectors on disk by their
distances, it makes me wonder if it can improve HNSW's low memory latency (or
even just latency as a whole).
Now that we have the "bulkScore" interface for scoring a set of candidates a
time, we could:
- prefetch vectors
- then bulk score
the bpvector reordering thing makes this more interesting as prefetch could
pull in vectors (by "accident") that will be scored soon (as vectors near
eachother are close together on disk).
Maybe this is just a crazy idea.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
