[FEA] Indexes to support `bitwise_jaccard` distance
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 per paper here, the Jaccard can be formulated as a bit-level dot-product (popc(AND)) with an expansion function. We're being asked to expose this for Oracle (among others).
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
Start by reading the linked paper on formulating Jaccard as a bit-level dot product. No source files, tests, or entry points are named in the issue, so locate the index and distance implementations first. Done means exposing index support for the bitwise_jaccard distance, including the requested Oracle use case.
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