W3C home > Mailing lists > Public > semantic-web@w3.org > September 2009

Re: SPARQL performance for ORDER BY on large datasets

From: carmen r <_@whats-your.name>
Date: Tue, 1 Sep 2009 22:51:24 +0000
To: SW-forum <semantic-web@w3.org>
Message-ID: <20090901225124.GA9445@x>
> precise query plan also sometimes yields surprises, because the 
> asymptotically optimal plan rarely coincides with the optimum plan 
> against a finite set of data

"progressive accuracy" is interesting..

"using fingerprinting and Bloom filters for rapid approximate evaluation ... result quality increases monotonically and converges with each evolution, offering “anytime” behaviour with arbitrary trade-off between computation time and query results"

http://www.eyaloren.org/pubs/iswc2008.pdf



> -- 
> Sampo Syreeni, aka decoy - decoy@iki.fi, http://decoy.iki.fi/front
> +358-50-5756111, 025E D175 ABE5 027C 9494 EEB0 E090 8BA9 0509 85C2
Received on Tuesday, 1 September 2009 22:52:06 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 1 March 2016 07:42:14 UTC