mercredi 8 février 2017

Find path length between two nodes of Dbpedia graph network, without knowing the underlying property path

Vote count: 0

I need to find the path length between any two nodes of Dbpedia graph,if there exists any connection between them. At this moment only start and end nodes are known to me and connected property paths are not known. So,I am attempting to write SPARQL query like:

PREFIX dbo:<http://ift.tt/UW96cQ;
PREFIX dbp:<http://ift.tt/1aI7wIh;

select dbp:Video dbo:VideoGame (count(?mid) as ?length) 
where {
  dbp:Video (<>|!<>)* ?mid .
  ?mid (<>|!<>)+ dbo:VideoGame .
}
group by dbp:Video dbo:VideoGame

Here I want to find path length between Video and VideoGame. But it is giving error like :

syntax error at 'dbo:VideoGame' before '}'

Can anyone help to write the correct one?

asked 30 secs ago

Let's block ads! (Why?)



Find path length between two nodes of Dbpedia graph network, without knowing the underlying property path

Aucun commentaire:

Enregistrer un commentaire