- From: Jacek Kopecky <jacek@systinet.com>
- Date: Thu, 21 Mar 2002 16:18:48 +0100 (CET)
- To: Martin Gudgin <marting@develop.com>
- cc: noah_mendelsohn@us.ibm.com, Herve Ruellan <ruellan@crf.canon.fr>, Henrik Frystyk Nielsen <henrikn@microsoft.com>, <soap@zaks.demon.co.uk>, <xml-dist-app@w3.org>
Gudge,
I disagree with your point 3 because (as indicated in [1]) you
can have a graph serialized into two headers and still no
out-of-line nodes.
I don't see where one would really _need_ out-of-line nodes, if
even if only for significantly easier processing (on the writer,
probably, for the reader must accept everything).
Best regards,
Jacek Kopecky
Senior Architect, Systinet (formerly Idoox)
http://www.systinet.com/
On Thu, 21 Mar 2002, Martin Gudgin wrote:
> I would also like the answers to these questions. My own feelings are as
> follows;
>
> 1 a single envelope can contain multiple disjoint graphs
>
> 2 If there are href/id connections between two header entries, they are a
> single graph
>
> 3 In light of 2 we probably need to spell out that graph nodes can be
> serialized in-line or out-of-line
>
> Gudge
>
>
>
Received on Thursday, 21 March 2002 10:18:51 UTC