W3C home > Mailing lists > Public > www-di@w3.org > June 2005

[DPF]DPFProperty hierarchies as RDF Graphs

From: Keith Waters <kwaters@ftrd.us>
Date: Mon, 6 Jun 2005 11:57:10 -0400
To: www-di@w3.org
Message-Id: <53316BBD-A83D-4A65-8693-2BDE4FF5DCDB@ftrd.us>
Hi Jeremy and Mark,

This message contains a response to comments on


We redrew fig2 as in the attached PDF file.
We simplified the lines, so that they just show parent/child  
relationships, and not sibling relationships.
We added arrows to the lines rather than relying on the vertical  
convention of parents above children.
We clarified that the labels (except DPF component) were describing  
the relationship between parent and child, rather than describing the  
We also added a little bit more, to show how a value could be drawn  
in the picture, as a leaf node, with the value labelling the node.
This picture then is an RDF graph, and conveys much of the  
information of fig 2.
The (implicit) resource values of the properties are made explicit as  
unnamed circles, and the property names are used to appropriate link  
the ovals in the diagram. This diagram does not suffer the problem of  
figure 2 that the labels GPS and IBM:GPS and NOKIA:GPS are used to  
show the relationship between the parent node and the labelled node,  
whereas the label "DPF Component" does not, which is visually confusing.

The DPF Working Group has reviewed the comment and Figure 2 has been  
updated to reflect A/B/C:GPS. This diagram is not intended to  
illustrate RDF graph structure.

-Keith Waters

(image/png attachment: dpf2.png)

Received on Monday, 6 June 2005 22:41:53 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 19:54:24 UTC