[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

"Deep-Equal Nodes" (Was: RE: Can sets have order? )

Subject: "Deep-Equal Nodes" (Was: RE: Can sets have order? )
From: Dimitre Novatchev <dnovatchev@xxxxxxxxx>
Date: Fri, 2 Feb 2001 00:10:52 -0800 (PST)
deep equal
> Not the same node, yes, but nodes which have the same values for
> all
> their attributes and attributes of subelements (i.e., which are
> deep-equal).  Such nodes may be exchanged in the node set without
> changing the behavior of any XPath query.

I regard the whole notion of "Deep-Equal Nodes" as a misconception:

1. It already confused people into thinking that indistinguishable
nodes could exist.

2. Letting such "indistinguishable" pairs of nodes in an xml document
has all problems and anomalies of non-normalized data.

3. This will also lead to artificially increasing the necessary memory
and processing time for an XML document.

How to avoid such nodes? Here's one simple way:

<node1 ID="id1">
  <!--  Any contents goes here -->

<node2 RefID="id1"/>


Get personalized email addresses from Yahoo! Mail - only $35 
a year!  http://personal.mail.yahoo.com/

 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list

Current Thread


Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
First Name
Last Name
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.