Thanks Hugh, and Kinglsey. I am working on it right now, will revert as
soon as I have done the needful.
- abhishek
On 17 January 2014 19:55, Kingsley Idehen wrote:
> 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,?rel
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{
?b ?c . ?c ?rel1 ?d. ?d ?rel2 ?g. ?y ?g.
}
It takes about 23 seconds. Now, if I execute following queries:
1. Find all nodes (and relationships) from (?c)
2. Fin
Hi Abhishek,
Hard to say you should profile the queries as indicated at [1], to see the
compiler and execution plans and where the time is being take performing query.
If you can provide this for the problem query and one that works well we might
be able to say more ...
Best Regards
Hugh Willi
I have a graph on which I run following query:
SELECT ?b,?c,?rel1,?d,?rel2,?g,?y
WHERE{
?b ?c . ?c ?rel1 ?d. ?d ?rel2 ?g. ?y ?g.
}
It takes about 23 seconds. Now, if I execute following queries:
1. Find all nodes (and relationships) from (?c)
2. Find all nodes (and relationships) from above
