Dedicated Graph Query Documentation Page #3621
Aderinom
started this conversation in
Documentation
Replies: 1 comment
-
Yes, I need much more documentation on graph relations as well. Particularly traversing relations, filtering on different intermediate fields, returning fields from different tables in the traverse. And doing it all performantly - do we need indexes? Can we change the order of traversals to improve things? |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hello SurrealDB community!
I am new to Graph Databases and the Query Language around them.
Currently I have found three places in the Documentation which show how the Graphing language is used.
Some features I have not seen in the docs but under discussions and other sources were e.g.
Selecting * from the remote Node (.* / [*]):
->knows->person.*
/->knows->person[*]
Search in both directions at the same time (<-> operator)
->knows<->person.*
AS naming for nodes
->knows->(person as T1Know)->knows->(person as T2Know)
There are also some queries which get accepted but have no effect which could be useful to either mention (especially since I assume this will have a performance impact) or handle in the parsing logic.
E.g.
->likes->person.*
returns the same as->likes.*->person.*
Also a topics which I had to search for but would be useful to be mentioned.
Not supported as of now:
https://github.com/orgs/surrealdb/discussions/1597 Graph traversal and directionless relations
Feature: Recursive relation query #1250
Feature: Recursive SurrealQL queries #197
Lastly, it would also be useful to hear a high level description of how Graph queries are resolved/ usual performance tripfalls/ best practices.
Beta Was this translation helpful? Give feedback.
All reactions