Lists Home |
Date Index |
- From: Tyler Baker <firstname.lastname@example.org>
- To: James Clark <email@example.com>
- Date: Thu, 11 Feb 1999 07:33:45 -0500
James Clark wrote:
> Tyler Baker wrote:
> > In terms of O notation (I hate to be academic here) that is N^2 plus the underlying cost of
> > string comparisons.
> Huh? The time for each element is linear in the number of attributes
> that the element has.
I guess it all depends on how you look at things. If you consider an XML document as a set of nodes
that you must iterate over and you consider all attributes to be sets of nodes within each element
node you get N^2 time. If you consider attributes to be nodes of the XML document then you get N
time. I guess it depends on how you look at things here. I chose to look at the entire document as
a set of elements, with each element containing a set of zero or more attributes.
> > And you still need to reparse the entire document each time to safely create these bindings as
> > the source tree can mutate at any time.
> You need to do the namespace processing each time. You don't have to do
> the parsing each time.
This is what I meant (sorry for the confusion). I meant that you need to in effect reparse the
document whether it be a stream, sax events, or a DOM tree and rebuild your entire namespace map
each time. Nevertheless, this is not cheap.
xml-dev: A list for W3C XML Developers. To post, mailto:firstname.lastname@example.org
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:email@example.com the following message;
To subscribe to the digests, mailto:firstname.lastname@example.org the following message;
List coordinator, Henry Rzepa (mailto:email@example.com)