Descriptor Set Optimizations: Fast-Path to bypass graph when not needed
- Dominant language
- C++
- Stars
- 93
- Forks
- 34
- PR merge metrics
- No merged PRs in 30d
Description
**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.
Contributor guide
Assessment
This issue has not been assessed yet.