On Feb 1, 2008 11:39 AM, Ivan Mikhailov wrote:
> Hello Rajeev,
>
> I'm unable to read the text in question but I see codepoint numbers in
> the sample, ans I see that they're in range that described as
> { "Malayalam", UCP_ALPHA, 0x0D00, 0x0D7F, NULL, NULL, NULL }
> in libsrc/langfunc/langfun
Hi Ivan and friends,
I have a query, which takes an unusual amount of time - as far as I
can tell, it never completes!
When I remove a triple from the where pattern i.e.,
?s ?p .
and replace it with
?s ?p ?d .
It executes immediately and returns a response.
How can I make this faster ?
Re
Hello Pierre,
In the next release of Virtuoso Open Source that should happen during
this weekend, the following query will work:
SELECT count (?g) ?g WHERE { graph ?g {?s ?p ?o}} order by (count(?g))
Note parentheses around (count(?g)) after order by.
Depending on version you're using now, the
Hi,
I would like to get a list of named graphs ordered by number of triples per
graph. So, I try (without success):
sparql select count(?g) ?g where {graph ?g {?s ?p ?o}} order by count(?g);
Is there a way to sort on aggregates in Virtuoso SPARQL?
Pierre
