On 1/17/14 4:48 AM, Abhishek Gupta wrote:
I have a graph on which I run following query:SELECT ?b,?c,?rel1,?d,?rel2,?g,?y WHERE{ <something1> ?b ?c . ?c ?rel1 ?d. ?d ?rel2 ?g. <something2> ?y ?g. } It takes about 23 seconds. Now, if I execute following queries: 1. Find all nodes (and relationships) from <something1> (?c) 2. Find all nodes(and relationships) from above (?d1) 3. Find all nodes(and relationships) from <something2> (?g) 4. Find all nodes(and relationships) from above (?d2)Find paths using the above four using simple python functions. This process takes less than a second.Is there anything that I am doing wrong here? Regards Abhishek
Are you able to reproduce your problems using one of the following: 1. http://lod.openlinksw.com/sparql 2. http://dbpedia.org/sparql 3. http://linkeddata.uriburner.com/sparql 4. http://dbpedia-live.openlinksw.com/sparql. If you can, just share the SPARQL Query Results URL. -- Regards, Kingsley Idehen Founder & CEO OpenLink Software Company Web: http://www.openlinksw.com Personal Weblog: http://www.openlinksw.com/blog/~kidehen Twitter Profile: https://twitter.com/kidehen Google+ Profile: https://plus.google.com/+KingsleyIdehen/about LinkedIn Profile: http://www.linkedin.com/in/kidehen
smime.p7s
Description: S/MIME Cryptographic Signature
------------------------------------------------------------------------------ CenturyLink Cloud: The Leader in Enterprise Cloud Services. Learn Why More Businesses Are Choosing CenturyLink Cloud For Critical Workloads, Development Environments & Everything In Between. Get a Quote or Start a Free Trial Today. http://pubads.g.doubleclick.net/gampad/clk?id=119420431&iu=/4140/ostg.clktrk
_______________________________________________ Virtuoso-users mailing list Virtuoso-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/virtuoso-users
