القائمة
Find nearest-neighbor nodes with the db.idx.vector.queryNodes procedure when a vector index exists
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Use algo.SPpaths/algo.SSpaths procedures and variable-length patterns to find paths in read queries
Search text properties with the db.idx.fulltext.queryNodes procedure when a full-text index exists
Write predicates that let FalkorDB use indexes and avoid full scans in read queries
Prefix read queries with CYPHER parameters for plan caching and safer value handling
| name | Query FalkorDB vector indexes |
| description | Find nearest-neighbor nodes with the db.idx.vector.queryNodes procedure when a vector index exists |
Use FalkorDB's vector search procedure to find approximate nearest neighbors by embedding similarity.
Only when the ontology declares a vector index for the label and property, call
db.idx.vector.queryNodes('Label', 'property', k, vecf32([...])) and yield node, score.
CALL db.idx.vector.queryNodes('Product', 'embedding', 5, vecf32([0.1, 0.2, 0.3])) YIELD node, score
RETURN node.name, score
k is the number of nearest neighbors to return; results are ordered by similarity.vecf32([...]).YIELD node, score exposes each match and its similarity score.