Does SPTAG support binary index and hamming distance?
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 5k
- Forks
- 622
- Avg merge
- 8h 37m
- Merged PRs (30d)
- 5
Description
Is your feature request related to a problem? Please describe.
In our project, we have binary vectors and hamming distance.
Describe the solution you'd like
We hope SPTAG can support binary vector index and hamming distance.
Describe alternatives you've considered
We can use int8 and cosine distance instead. But it will consume much more memory and the search will be slow down.
Contributor guide
No contributing guide indexed for this repository
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 locating SPTAG's existing vector-index and distance implementations, then determine how binary vectors and Hamming distance would fit. Done would require a defined implementation scope, support for the requested data and distance types, and verification of search behavior and memory usage.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100