fennel-ai/fann
View on GitHub ↗ ★ 166 Rust
Approx nearest neighbor search in Rust
3 mentions on Hacker News by 3 people: 0 stories, 3 comments · first 2023-06-15 · latest 2023-06-15
20082026
-
…found that an index of 1M vectors using 15 trees can be built up in ~115 seconds (8 CPU, 8 GB RAM). https://github.com/fennel-ai/fann/pull/8 . Given this, around a second to build an index of 10K items sounds about right.
comment by nikhilgarg28 · 2023-06-15 · in FANN: Vector Search in 200 Lines of Rust -
…is still probably good enough for most use cases. IMO the exhaustive search should use a heap https://github.com/fennel-ai/fann/blob/main/src/main.rs#L12 as you're only looking for top-k, it reduces time and memory complexity greatly. On a…
comment by huac · 2023-06-15 · in FANN: Vector Search in 200 Lines of Rust -
isn't it in https://github.com/fennel-ai/fann/blob/main/src/search.rs#L1... ?
comment by un_ess · 2023-06-15 · in FANN: Vector Search in 200 Lines of Rust