Re: a subject-oriented nested dictionary with simple keys for RDF

Hi Peter,

Peter Frederick Patel-Schneider wrote:
> From: David Wood <david.wood@talis.com>
> Subject: Re: What *is* RDF?
> Date: Fri, 25 Mar 2011 10:00:27 -0500
> 
> [...]
> 
>> It would be helpful to focus this discussion on whether we can create a
>> subject-oriented nested dictionary with simple keys that represents (a
>> useful subset of) RDF.
>>
>> Regards,
>> Dave
> 
> How about the following?
> 
> 
>                 Serializing RDF into JSON
> 
> - inputs - G - an RDF graph, to be serialized
>          - B - an IRI, to be treated as the base IRI
> - requirements - all blank nodes have universally unique nodeIDs
> - not handled - ill-formed (i.e., non tree-like) RDF collections
>               - RDF collection nodes with extra outgoing edges
> - not covered - details of serializing IRIs
> 
> Create a JSON array A with values as given below
> For each node N in G that is the subject of some triple in G and is
>     not a structural collection node create a JSON object N''' as
>     follows 
>   The first member of N''' is "sameAs" : N'
>   Let NS be the triples in G that have N as their subject
>   For each node P in G that is a predicate in NS
>     Let NSP be the triples in NS with predicate P
>     For each triple in NSP (with the most important last, if desired)
>       Let O be the object of the triple 
>       The next member of N''' is "S'" : O''

or: The next member of N''' is "P'" : O'' ?

(just want to clarify before replying properly)

Received on Saturday, 26 March 2011 21:43:31 UTC