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
I am new to graph databases, but as I understand it, they make k-hop queries possible and efficient.
That is, finding the list of nodes that are k distance away from a given node. With a possibility to specify a cost function for each hop so as to order the results.
Does SurrealDB support or plan to support such queries natively?
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
I am new to graph databases, but as I understand it, they make k-hop queries possible and efficient.
That is, finding the list of nodes that are k distance away from a given node. With a possibility to specify a cost function for each hop so as to order the results.
Does SurrealDB support or plan to support such queries natively?
Beta Was this translation helpful? Give feedback.
All reactions