- From: Olaf Hartig <OleBowle@gmx.de>
- Date: Thu, 22 Jun 2006 11:15:09 +0200
- To: public-sparql-dev@w3.org
Received on Thursday, 22 June 2006 16:16:26 UTC
Hello, 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? -- Bye, Ole ---------- GnuPG key: http://www.informatik.hu-berlin.de/~hartig/hartig.asc
Received on Thursday, 22 June 2006 16:16:26 UTC