Re: SPARQL 1.1 computational complexity and/or optimisation

Hi Steve,

Maybe that here helps:

Axel Polleres and Johannes Wallner. On the relation between sparql1.1 and answer set programming. Journal of Applied Non-Classical Logics (JANCL), 23(1-2):159-212, 2013. Special issue on Equilibrium Logic and Answer Set Programming. http://www.tandfonline.com/doi/abs/10.1080/11663081.2013.798992

At least, here we emphasize that non-recursive Datalog (as for SPARQL1.0) is no longer sufficient for several of the new features in SPARQL1.1.

best regards,
Axel


--
Prof. Dr. Axel Polleres
Institute for Information Business, WU Vienna
url: http://www.polleres.net/  twitter: @AxelPolleres

On Dec 2, 2013, at 7:24 PM, Steve Hargreaves <steve.harg@gmail.com> wrote:

> Dear list,
> 
> Apologies if this has come up before (my searches so far have drawn a blank), but I'm wondering if anyone can point me to any research papers which attempt to determine the computational complexity of SPARQL 1.1 or which suggest methods for optimising SPARQL 1.1 queries.
> 
> I'm specifically looking for 1.1 related material - I can find plenty of papers for the original SPARQL, e.g.
> 
> Jorge Pérez, Marcelo Arenas, and Claudio Gutierrez. 2009. Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34, 3, Article 16 (September 2009), 45 pages. DOI=10.1145/1567274.1567278 http://doi.acm.org/10.1145/1567274.1567278 
> 
> Michael Schmidt, Michael Meier, and Georg Lausen. 2010. Foundations of SPARQL query optimization. In Proceedings of the 13th International Conference on Database Theory (ICDT '10), Luc Segoufin (Ed.). ACM, New York, NY, USA, 4-33. DOI=10.1145/1804669.1804675 http://doi.acm.org/10.1145/1804669.1804675 
> 
> but I'm particularly interested in 1.1-specific features such as subqueries and aggregate functions.
> 
> 
> Best regards,
> 
> Steve Hargreaves
> 
> 
> Centre for Digital Music
> Electronic Engineering
> Queen Mary University of London
> Mile End Road
> London E1 4NS
> UK

Received on Monday, 2 December 2013 21:51:20 UTC