meilisearch/arroy

View on GitHub

An Approximate Nearest Neighbors library in Rust, based on random projections and LMDB and optimized for memory usage :boom:

Stars: 311
Forks: 17
Open beginner issues: 0
Indexed issues: 29

Dominant language: Rust
License: MIT
Last GitHub push: Oct 16, 2025
Latest indexed: Sep 19, 2026
Contributing guide: No contributing guide
Code of conduct: No code of conduct
Beginner labels: good first issue
PR merge metrics: No merged PRs in 30d

Beginner friendly Everything

Open All

29 open issues indexed

`0.6.3` contains breaking change Open

Difficulty 2/5 1-3 hours Newbie friendliness 45/100

meilisearch/arroy#158 · Opened Nov 2, 2025
Proposal: Use a bounded top-K heap in nns_by_leaf instead of full sort Open

Difficulty 4/5 3-5 days Newbie friendliness 48/100

meilisearch/arroy#156 · Opened Oct 31, 2025
`Reader::iter` may return vectors with the wrong dimensions Open

bug

Difficulty 3/5 1-2 days Newbie friendliness 42/100

meilisearch/arroy#152 · Opened Sep 2, 2025
Verbose logs in DEBUG level Open

Difficulty 3/5 1-2 days Newbie friendliness 45/100

meilisearch/arroy#148 · Opened Jul 1, 2025
Still too slow when there is not enough RAM Open

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#145 · 4 comments · Opened Jun 20, 2025
submit arroy to ann-benchmarks Open

Difficulty 4/5 3-5 days Newbie friendliness 35/100

meilisearch/arroy#142 · 1 reaction · Opened Jun 18, 2025
insert_descendants_in_file_and_spawn_tasks is multi-threaded only when there is not enough RAM Open

performance

Difficulty 4/5 3-5 days Newbie friendliness 35/100

meilisearch/arroy#139 · Opened Jun 17, 2025
Something else I noticed is that 12% of the time is spent on this function: Open

indexing performance

Difficulty 4/5 3-5 days Newbie friendliness 25/100

meilisearch/arroy#136 · 1 comment · Opened Jun 12, 2025
Update the dependencies before releasing the v0.7 Open

Difficulty 4/5 3-5 days Newbie friendliness 20/100

meilisearch/arroy#135 · Opened Jun 10, 2025
Python support Open

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#131 · 9 comments · 1 reaction · Opened May 28, 2025
Rename ImmutableLeaf to ImmutableItems Open

maintenance

Difficulty 2/5 1-3 hours Newbie friendliness 48/100

meilisearch/arroy#122 · Opened Apr 16, 2025
Remove the use of the nohash crate Open

good first issue

Difficulty 3/5 1-2 days Newbie friendliness 38/100

meilisearch/arroy#121 · Opened Apr 16, 2025
Introduce Hamming distance for binary quantization Open

Difficulty 4/5 3-5 days Newbie friendliness 25/100

meilisearch/arroy#102 · 4 comments · 2 reactions · Opened Dec 22, 2024
Optimize deletion by taking a transaction of the previous version of the database Open

breaking enhancement performance

Difficulty 5/5 Over a week Newbie friendliness 35/100

meilisearch/arroy#95 · 2 reactions · Opened Sep 24, 2024
When building a tree or opening a writer, we don't check if the distances matches Open

bug

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#92 · Opened Sep 18, 2024
Speed up filter ANDs operations Open

good first issue performance

Difficulty 3/5 1-2 days Newbie friendliness 45/100

meilisearch/arroy#80 · Opened Jun 26, 2024
Expose `ItemIter` publicly Open

documentation good first issue

Difficulty 2/5 1-3 hours Newbie friendliness 45/100

meilisearch/arroy#70 · Opened Mar 21, 2024
Measure and improve the performances of the incremental indexing Open

Difficulty 4/5 3-5 days Newbie friendliness 35/100

meilisearch/arroy#61 · Opened Jan 15, 2024
The `Side` function behave strangely on two dimensions Open

bug relevancy

Difficulty 4/5 3-5 days Newbie friendliness 30/100

meilisearch/arroy#59 · Opened Jan 15, 2024
Do not use the vector dimensions as the number of items in a descendant node Open

enhancement

Difficulty 4/5 3-5 days Newbie friendliness 38/100

meilisearch/arroy#58 · 1 comment · Opened Jan 15, 2024
Do we need to re-compute the normal of all the impacted nodes when incremental indexing? Open

indexing relevancy

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#53 · Opened Jan 10, 2024
Update the pre-processor Open

indexing

Difficulty 4/5 3-5 days Newbie friendliness 25/100

meilisearch/arroy#52 · Opened Jan 10, 2024
Look into binary indexes Open

tech exploration

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#45 · Opened Dec 13, 2023
Try using `MDB_INTEGERKEY` along with a custom comparator Open

enhancement

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#44 · Opened Dec 8, 2023
Allow users to omit the dimensions when creating the `Writer` Open

Difficulty 4/5 3-5 days Newbie friendliness 45/100

meilisearch/arroy#42 · Opened Dec 7, 2023
Measure the time it takes for Arroy vs Annoy to build trees in parallel Open

documentation

Difficulty 4/5 3-5 days Newbie friendliness 35/100

meilisearch/arroy#40 · Opened Dec 6, 2023
Measure and improve the constant numbers used when building the tree Open

enhancement

Difficulty 5/5 Over a week Newbie friendliness 25/100

meilisearch/arroy#35 · Opened Dec 4, 2023
Log more what is happening in the build function Open

Difficulty 3/5 1-2 days Newbie friendliness 25/100

meilisearch/arroy#33 · Opened Dec 3, 2023
Propose to list Arroy into the Annoy README Open

Difficulty 1/5 Under an hour Newbie friendliness 30/100

meilisearch/arroy#17 · Opened Nov 29, 2023

meilisearch/arroy

Get new issues in your inbox