- From: Richard Cyganiak <richard@cyganiak.de>
- Date: Fri, 23 Jun 2006 15:06:16 +0200
- To: Olaf Hartig <OleBowle@gmx.de>
- Cc: public-sparql-dev@w3.org
Olaf, On 22 Jun 2006, at 11:15, Olaf Hartig wrote: > In a recent paper about "Semantics and Complexity in > SPARQL" (http://www.dcc.uchile.cl/~cgutierr/ftp/sparql-ext.pdf) > Perez et.al. > mention two approaches to compute solutions for graph patterns - > one using a > procedural semantics and another using a compositional semantics. > As a real > implementation for the first they name Jena's ARQ. I'm interested > in an > implementation following the second approach. Does someone, > familiar with the > paper, know of any? sparql2sql [1] implements only a subset of SPARQL, but that subset is evaluated using compositional semantics. Best, Richard [1] http://jena.sourceforge.net/sparql2sql/ > -- > Bye, > Ole > ---------- > GnuPG key: http://www.informatik.hu-berlin.de/~hartig/hartig.asc >
Received on Friday, 23 June 2006 13:06:57 UTC