- From: Ruben Verborgh <ruben.verborgh@ugent.be>
- Date: Mon, 29 Jun 2015 17:34:38 +0200
- To: John Walker <john.walker@semaku.com>
- Cc: public-linked-data-fragments@w3.org, Markus Lanthaler <markus.lanthaler@gmx.net>, Miel Vander Sande <Miel.VanderSande@UGent.be>
> Maybe take a lead from the Graph Store HTTP Protocol method of indirect graph
> identification:
> http://www.w3.org/TR/2013/REC-sparql11-http-rdf-update-20130321/#indirect-graph-identification
Thanks, that's a relevant pointer indeed.
> Just wondering out loud, but how would you go about making the request to list
> all the graph names to such a quads interface?
Yeah, I kind of messed up there.
DISTINCT is not part of the TPF interface; it would be more for patterns like
GRAPH ?g { ?x a foaf:Person }
i.e., which graphs contain people?
> But I would guess this would return all statements that are in a named graph
> (rather than the list of graphs), which potentially could be a lot of data.
Exactly.
DISTINCT would actually be a nice separate interface feature
that servers might decide to offer to clients.
Best,
Ruben
Received on Monday, 29 June 2015 15:35:12 UTC