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

IDREF vs HREF for graph edges in SOAP encoding

From: Marc Hadley <marc.hadley@sun.com>
Date: Thu, 10 Jan 2002 14:28:08 +0000
Message-ID: <3C3DA4F8.4090105@sun.com>
To: XML dist app <xml-dist-app@w3c.org>

On last nights telcon, Jacek and I took an action to start discussion on 
the list about the merits of using IDREFs instead of generic HREFs for 
representing graph edges in the SOAP encoding.

Attached is a table and commentary in HTML format listing a number of 
problems and issues concerned with the use of links as graph edges. 
Possible solutions are also shown for the two cases: graph edges as 
IDREFs or generic hrefs.

Note that switching to IDREFs for graph edges does not preclude use of 
arbitrary links in encoded data. The switch only affects the kind of 
links used for encoded graph edges.

Comments, flames, etc ?

Marc and Jacek.

Marc Hadley <marc.hadley@sun.com>
XML Technology Centre, Sun Microsystems.

Jacek Kopecky <jacek@systinet.com>
Senior Architect, Systinet (formerly Idoox)

Received on Thursday, 10 January 2002 09:31:11 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 23:11:45 UTC