When we write a query like:
select ?s,?p,?o where {
?s ?p ?o. filter (?p = foaf:name).
}
Is there a way to write query like following, but still l get ?p or the
relations connecting the two:
select ?s,?o where
{
?s foaf:name ?o.
}
Motivation is to avoid filters to decrease query times, and
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
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
Soft Reminder.
Thanks
Abhishek
On 4 November 2013 03:07, Abhishek Gupta wrote:
> Sorry for the delayed response.
>
> Both the links are giving 404 errors. Is that expected?
>
> Regards
> Abhishek
>
>
> On 31 October 2013 18:08, Kingsley Idehen wrote:
>
>>
Sorry for the delayed response.
Both the links are giving 404 errors. Is that expected?
Regards
Abhishek
On 31 October 2013 18:08, Kingsley Idehen wrote:
> On 10/31/13 6:44 AM, Abhishek Gupta wrote:
>
> Hi
>
> Thanks for such a smooth ride with virtuoso, with so many resou
weights directly).
The precise problem that I am trying to solve is to find "shortest path"
between two nodes in an undirected weighted graph. Any pointers will be
appreciated. I am using virtuoso-opensource and this isn't a homework ;)
Thanks
Abhishek Gupta
Co
