[FEA] Bloom filtering primitive
Open
Nobody has claimed this yet.
feature request
- Dominant language
- Cuda
- Stars
- 854
- Forks
- 236
- Avg merge
- 3d 3h
- Merged PRs (30d)
- 62
Description
As our filtering capability continues to grow in importance, we're being asked for optimized filtering primtives. Bloom filtering is an important and general primitive and we should have an efficient implementation in cuVS.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no files, tests, or entry points. Start by surveying cuVS's existing filtering primitives and repository structure, then clarify the Bloom-filter API and efficiency criteria with maintainers. Done means an efficient Bloom filtering primitive is implemented in cuVS.
Written by the indexing model from the issue text.
Assessment
- Domain
- search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100