You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Nov 21, 2024. It is now read-only.
Is there any plan to implement efficient HNSW based ANN with filtering? Imagine you have a table:
CREATETABLEdocument (
id UUID PRIMARY KEY,
textTEXTNOT NULL,
embedding REAL[] NOT NULL,
category TEXTNOT NULL
)
And then you want to do a query like:
SELECT id, textFROM document
WHERE category = $1ORDER BY embedding <-> $2LIMIT10;
To do this efficiently is not straightforward and will likely need some work, see e.g.: https://qdrant.tech/articles/filtrable-hnsw/
(In this scenario, you could probably achieve similar effect by partitioning the table -- but that's not possible for more complex filters)
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Is there any plan to implement efficient HNSW based ANN with filtering? Imagine you have a table:
And then you want to do a query like:
To do this efficiently is not straightforward and will likely need some work, see e.g.: https://qdrant.tech/articles/filtrable-hnsw/
(In this scenario, you could probably achieve similar effect by partitioning the table -- but that's not possible for more complex filters)
The text was updated successfully, but these errors were encountered: