Is there a way finding the shortest path between two nodes using SPARQL in GraphDB?

0
votes

I would like to find the shortest path (if exists) between two nodes. The property path which includes the * operator doesn't help me, because i cannot find the shortest one using it. Is there a function like the shortestPath() one which Neo4j has?

1
neo4jsparqlshortest-pathgraphdb
no there is no such function. – UninformedUser
other than that, you can try something like suggested here and here though both have obvious limitations because SPARQL was never meant to be a graph traversal language like Cypher, Gremlin, etc. – UninformedUser
They use client code here: graphdb.ontotext.com/free/devhub/map.html. Try Stardog, Anzograph, Blazegraph (google "‹triplestore› + shortest path"). – Stanislav Kralin

1 Answers

0
votes

If you have a lot of data you might want to consider using AnzoGraph. Docs and examples here https://docs.cambridgesemantics.com/anzograph/v2.2/userdoc/shortest-path.htm

Disclaimer: I work for Cambridge Semantics Inc.