Hi everyone. I have this (classical) graph traversal use case: in a graph, let's find all the paths from resource A to resource B.
AFAIU, SPARQL has a dedicated syntax for that. (called property path). In my use case, the property paths to match have unknown length. I think Virtuoso stores triples in a g,s,p,o table. So property paths of unknown length will be translated into a massive amount of self-joins. Does it sound right? How would TDB handle those property paths? With a similar strategy? And then, the graph databases. Do they have an internal structure that makes this graph traversal more natural? Or do they rely, eventually, on similar strategies? Any help of that subject would be of great interest.
