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.

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

Descriptor Set Optimizations: Fast-Path to bypass graph when not needed #177

Open
ifadams opened this issue Jul 23, 2024 · 0 comments
Open
Assignees
Labels
Discussion Needed Require additional context and discussion Enhancement New features or upgrades for functionality, performance, etc

Comments

@ifadams
Copy link
Contributor

ifadams commented Jul 23, 2024

Is your feature request related to a problem? Please describe.
Database queries are often relatively slow, even when well optimized. We've found cases that need minimal/no interaction with the graph database, that have to wait on a heavy-weight DB transaction to complete, even if the results are not needed.

Describe the solution you'd like
Ideally, we should have a set of checks/flags that let us bypass the database query logic when its obviously not needed. For example, something like when we're using an engine that internally stores FV values or pointers for a KNN search, and an incoming VDMS query has no constraints we obviously dont care about what graph results are returning, we should be able to bypass the graph logic entirely and have a much faster return time from the client perspective.

@ifadams ifadams added Enhancement New features or upgrades for functionality, performance, etc Discussion Needed Require additional context and discussion labels Jul 23, 2024
@ifadams ifadams self-assigned this Jul 23, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Discussion Needed Require additional context and discussion Enhancement New features or upgrades for functionality, performance, etc
Projects
None yet
Development

No branches or pull requests

1 participant