Giters

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

Do we need to re-compute the normal of all the impacted nodes when incremental indexing?

irevoire opened this issue · comments

commented

This could improve the relevancy, it needs to be tested