AT
Apache TinkerPopNeptunion
Is the first traversal pattern evaluated by Match well defined
Hi,
It seems to me that if the match step is able to dynamically select the first traversal pattern (as it does all other traversal patterns), and this selection isn't the same across all traversers, the behaviour of match isn't well defined.
Consider the simple graph
Suppose we have some match statement with two patterns that both capture endpoint vertices x and y, such that the patterns both match x=a, y=c and x=c, y=a.
Extremely long-winded but basically both patterns will move either two out or two in (acyclicly) and capture the endpoints.
If the traverser starting at vertex a evaluates the first pattern first, and the traverser starting at vertex b evaluates the second pattern first; they will both have the same result [(x=a, y=b)], instead of the expected behaviour [(x=a, y=b), (x=b, y=a)].
I'd imagine right now the first pattern is just evaluated, but I'm not entirely sure about if this is guaranteed for OLAP, and it's also not documented as far as I can tell.
Apache TinkerPop is an open source graph computing framework and the home of the Gremlin graph query language.
1.3KMembers
View on DiscordWant results from more Discord servers?
More Posts.mergeV() with Javascript not workingHi, I have a nodeJS 18 lambda which is closely modeled after this documentation: https://docs.aws.amUnable to deserialize results with Gremlin-go client + JanusGraphHi all - I'm trying to set up a JanusGraph database and use the Gremlin-go client to run some gremliFulltext-search-like features without ElasticSearch, OpenSearch, Solr and such?I've read in multiple sources that Apache TinkerPop isn't optimized for text search operations like Conditionally updating a variable with choose()How do I create and update a variable with a conditional? I need a number to be calculated based on