Re: SPARQL GSP vs BP

> From: Arnaud Le Hors/Cupertino/IBM@IBMUS
> To: public-ldp-wg@w3.org, 
> Date: 07/05/2012 10:59 AM
> Subject: SPARQL GSP vs BP
> 
> Looking at how the SPARQL Graph Store Protocol (GPS) and Basic Profile 
(BP) 
> submission compare, the most obvious difference I see is the fact GPS 
> primarily deals with "graphs" while BP deals with Basic Profile 
Resources 
> and Containers. 
> 
> So, I'd like to ask whether considering a BPR as a graph would, at least 
to 
> some extend, provide some alignment between the two specs. I think two 
> aspects need to be considered: 1) what URL is used, 2) what triples are 
returned. 
> 
> Thoughts?

Disclaimer: I have no implementation experience with this and only a basic 
understand on the review given on a previous call.

1) GPS for SPARQL-compliant graph store implementation and wants to expose 
it via HTTP (even though the abstract says it isn't limited to this), in 
contrast with BP where someone may not have a SPARQL-compliant graph 
store.

2) I also see BP as being focused on the resource-centric view of the web 
with access and manipulation of the resource being done via HTTP and 
representations.  GPS is mapping HTTP operations to named graphs.

3) BP of course adds a number of rules on representations, including 
defining a best practice concept of containers

I believe that there is value in both and they are not the same.   If GPS 
was built "on top" of BP, it would impose perhaps too many rules on 
resources and their representations.  If BP was built "on top" of GPS, it 
would impose graph constraints. 
It would seem that GPS would be more analogous to a SPARQL endpoint, while 
BP would be analogous to the access and manipulation of resources based on 
their URL directly.

Perhaps we should start a wiki page to track a more detailed comparison?

Thanks,
Steve Speicher | IBM Rational Software | (919) 254-0645

Received on Monday, 9 July 2012 12:54:24 UTC