Query Examples

[JBatUN]

Query Examples

[dxnn]

Hi JBatUN, thanks for the note!

As you discovered, the current query system is focused around collecting nodes, and doesn't return the set of edges followed to find those nodes. (In fact, any edges that match the query are consumed as the query is being processed.)

I think it would be very interesting to develop a subgraph-based graph database, which could return both nodes and edges from the matching subgraph(s). As far as I know no one has pursued this approach, but it is a natural fit to a variety of graph queries.

In the meantime, I'd suggest either modelling the data so that the values you need are all in the nodes, or running a small post-processing step to "fill in" the missing edges between nodes (since in cases like the one you describe this is relatively trivial).