Hey Hugh

You can all see the results of first query at
http://dbpedia.org/sparql?default-graph-uri=http%3A%2F%2Fdbpedia.org&query=select+%3Fmid+where+{%0D%0A++++%3Fmid+%3Chttp%3A%2F%2Fwww.w3.org%2F2004%2F02%2Fskos%2Fcore%23broader%3E{2}+%3Chttp%3A%2F%2Fdbpedia.org%2Fresource%2FCategory%3ASports%3E.%0D%0A++++%3Chttp%3A%2F%2Fdbpedia.org%2Fresource%2FCategory%3ABadminton_by_continent%3E+%3Chttp%3A%2F%2Fwww.w3.org%2F2004%2F02%2Fskos%2Fcore%23broader%3E+%3Fmid.%0D%0A}&format=text%2Fhtml&timeout=30000&debug=on


On Mon, Feb 10, 2014 at 6:50 PM, Nikunj Jain <nikunj...@gmail.com> wrote:

> Hey Hugh
>
> Running first query on http://dbpedia.org/sparql returns two results
>
>
> On Mon, Feb 10, 2014 at 7:03 PM, Hugh Williams 
> <hwilli...@openlinksw.com>wrote:
>
>> HI Nikunj,
>>
>> What Dbpedia server are you running these queries against as running
>> against http://dbpedia.org/sparql , both return no results ?
>>
>> Note also documentation on property paths support in Virtuoso can be
>> found at:
>>
>>
>> http://virtuoso.openlinksw.com/dataspace/doc/dav/wiki/Main/VirtTipsAndTricksSPARQL11PropertyPaths
>>
>>   Best Regards
>> Hugh Williams
>> Professional Services
>> OpenLink Software, Inc.      //              http://www.openlinksw.com/
>> Weblog   -- http://www.openlinksw.com/blogs/
>> LinkedIn -- http://www.linkedin.com/company/openlink-software/
>> Twitter  -- http://twitter.com/OpenLink
>> Google+  -- http://plus.google.com/100570109519069333827/
>> Facebook -- http://www.facebook.com/OpenLinkSoftware
>> Universal Data Access, Integration, and Management Technology Providers
>>
>> On 10 Feb 2014, at 07:11, Nikunj Jain <nikunj...@gmail.com> wrote:
>>
>> 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
>>
>>
>>
>
------------------------------------------------------------------------------
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

Reply via email to