Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

sparse vector approximate search optimization #1035

Open
3 tasks
sparknack opened this issue Jan 16, 2025 · 0 comments
Open
3 tasks

sparse vector approximate search optimization #1035

sparknack opened this issue Jan 16, 2025 · 0 comments

Comments

@sparknack
Copy link
Contributor

sparknack commented Jan 16, 2025 •
edited
Loading

This issue aims to accelerate sparse vector search by using some approximate strategies.

  • Add approximate upper bound ratio for DAAT algorithms like WAND and MaxScore.
  • Optimize existing approximate strategies like drop_ratio_build and drop_ratio_search
  • and so on
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sparknack