W3C home > Mailing lists > Public > xml-dist-app@w3.org > September 2002

Re: Issue 302: Graph edges that do not terminate

From: <noah_mendelsohn@us.ibm.com>
Date: Tue, 17 Sep 2002 09:38:56 -0400
To: Jacek Kopecky <jacek@systinet.com>
Cc: Marc Hadley <marc.hadley@sun.com>, Martin Gudgin <mgudgin@microsoft.com>, XMLP Dist App <xml-dist-app@w3.org>
Message-ID: <OFBFDC1B00.46248968-ON85256C37.004A1F32@lotus.com>

As you say, the editors draft makes the data model clear.  While I agree 
that from a graph-theory point of view, the structures are not the most 
obvious ones, I think they're coherent and OK for our purposes.  One 
reason I'm OK with this is that we do not in fact have names for the 
nodes, other then the name(s) of the inbound edge(s).  So:



           | 
           | 
           | A
           | 
     ----------- 
     | Struct  |
     -----------

is about as close as we have to a struct "named" A, which is a very 
natural for our applications of the encoding to, for example, RPC.  So, I 
think what we have is OK.  If the nodes had names independent of the 
edges, I would  be a little less comfortable, but they don't.

------------------------------------------------------------------
Noah Mendelsohn                              Voice: 1-617-693-4036
IBM Corporation                                Fax: 1-617-693-8676
One Rogers Street
Cambridge, MA 02142
------------------------------------------------------------------
Received on Tuesday, 17 September 2002 10:12:39 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:59:11 GMT