[OpenID] cryptographics web of trust

[Story Henry]

On 27 Aug 2007, at 21:06, Peter Williams wrote:

> Henry
>
>
>
> The third-party  FOAF library I’m using (SemWeb) offers a  
> GraphMatch method, to query the FOAF triples. This is an  
> alternative to using SPARQL queries. GraphMath queries can  
> themselves be specified in N3 (see below), and presumably thus be  
> represented and used in the same manner as all the other bits of  
> FOAF metadata
>

Yes. Clearly graph match is very similar to  the following SPARQL query


CONSTRUCT *
WHERE {
    ?bill rdf:type bill:SenateBill;
          bill:congress "108";
          bill:number "1024";
          bill:cosponsor ?person;
    ?person foaf:name ?name .
}

SPARQL does not have the CONSTRUCT * sadly, so you end up having to  
repeat the query in the
construct clause.

There are a lot of query languages that were developed and on which  
SPARQL was built....
>  I want to replace my current use of API code with stored queries.
>
Sounds good.
> For trivial lookup queries, like (a) find openid given card URI,  
> (b) find organizational affiliate given foaf:openid, (c) find  
> service given … …I’m hoping its sufficient to leverage these non- 
> SPARQL queries.
>
sounds good. Just that it seems like the graph match is one aspect of  
SPARQL.
On the client side use whatever tools make your work easiest, and  
also of course whatever works with your library. These things keep  
evolving.

> I can imagine using a full-power SPARQL query on the card to  
> initially locate a resource RDF document with these latter queries  
> in the GraphMatch vocabulary, and then apply GraphMatch given my  
> user-agent has the wits to process them.
>
>
>
> Sound a reasonable tack?
>
>
>
> Is there  an IANA alternatives best practices for RDF queries, much  
> like you exploited alternatives for negotiating which RDF  
> presentation layer protocol/format to use when communicating a  
> card? Does the awol schema support denoting alternative  
> representation of RDF queries, specifically, as SPARQL or such as  
> GraphMatch?
>
>
>
> ------------
>
>
>
> Excerpt from SemWeb documentation:
>
>
>
> “The first query method is the GraphMatch method using my own  
> "RSquery" query format, which is actually just plain RDF (think RDF- 
> squared query because it's an RDF query over RDF data). A simple  
> RSquary query is just a graph to be matched against the target data  
> model, here in N3 format:
>
>
>
> @prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
>
> @prefix foaf: <http://xmlns.com/foaf/0.1/> .
>
> @prefix bill: <tag:govshare.info,2005:rdf/usbill/> .
>
>
>
> ?bill rdf:type bill:SenateBill .
>
> ?bill bill:congress "108" .
>
> ?bill bill:number "1024" .
>
>
>
> ?bill bill:cosponsor ?person .
>
> ?person foaf:name ?name .”
>
>
>
> _______________________________________________
> general mailing list
> general at openid.net
> http://openid.net/mailman/listinfo/general

-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 2429 bytes
Desc: not available
URL: <http://lists.openid.net/pipermail/openid-general/attachments/20070829/7469b4bb/attachment-0002.bin>