You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
But multi-threaded search over multiple segments in addition to multi-leaf collection (e.g. information sharing) can lead to consistent results at low k values.
It is possible to get more consistent results, and likely remove most inconsistencies by simply gathering more neighbors (k in the query, fanout in lucene util, or efSearch if you will...). However, while HNSW search is approximate, we should strive for consistency.
Version and environment details
No response
The text was updated successfully, but these errors were encountered:
Description
Related to: #14167
But multi-threaded search over multiple segments in addition to multi-leaf collection (e.g. information sharing) can lead to consistent results at low
k
values.It is possible to get more consistent results, and likely remove most inconsistencies by simply gathering more neighbors (
k
in the query,fanout
in lucene util, orefSearch
if you will...). However, while HNSW search is approximate, we should strive for consistency.Version and environment details
No response
The text was updated successfully, but these errors were encountered: