Hey, I am trying to calculate the paths between two nodes in dbpedia graph,
the path length can be anything. I tried these two queries to find the path
length of 3:
select ?mid where {
?mid <http://www.w3.org/2004/02/skos/core#broader>{2} <
http://dbpedia.org/resource/Category:Sports>.
<http://dbpedia.org/resource/Category:Badminton_by_continent> <
http://www.w3.org/2004/02/skos/core#broader> ?mid.
}
select ?mid,?alpha where {
?mid <http://www.w3.org/2004/02/skos/core#broader> ?alpha. ?alpha <
http://www.w3.org/2004/02/skos/core#broader> <
http://dbpedia.org/resource/Category:Sports> . <
http://dbpedia.org/resource/Category:Badminton_by_continent> <
http://www.w3.org/2004/02/skos/core#broader> ?mid.
}
According to me, both the queries should return same results. But the query
1 is returning http://dbpedia.org/resource/Category:Sport_by_continent two
times and query 2 is returning empty results. I need to know why this is
happening and what is the most efficient way to calculate the paths between
two nodes.
Thanks
------------------------------------------------------------------------------
Managing the Performance of Cloud-Based Applications
Take advantage of what the Cloud has to offer - Avoid Common Pitfalls.
Read the Whitepaper.
http://pubads.g.doubleclick.net/gampad/clk?id=121051231&iu=/4140/ostg.clktrk
_______________________________________________
Virtuoso-users mailing list
Virtuoso-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/virtuoso-users
