meilisearch / arroy

Spotify/Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage :boom:

Home Page:https://docs.rs/arroy

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Don’t make multiple centroid iterations on the same leaf

irevoire opened this issue · comments

commented

let node_k = leafs.choose(rng)?.unwrap();

Here we should remove the selected leaf from the list of possible leafs.
That means, when we have less than 200 leafs to split we can exit early.
It’ll impact relevancy but I’m pretty sure it won’t have a negative impact