my first impressions are that it's an algorithm problem, not a what it's
coded in problem.
if the algorithm is o(n2) then you can't really escape the problem, even
with hardware.
as it is a very real problem for me (and therefore my customers) this is
something i'll be tackling, probably starting in a few days.
i'll post the results in due course.
rick
Michael Kay wrote:
>>My expectation is that XML parsing can be significantly sped up with ...
>>
>>
>
>I think that UTF-8 decoding is often the bottleneck and the obvious way to
>speed that up is to write the whole thing in assembler. I suspect the only
>way of getting a significant improvement (i.e. more than a doubling) in
>parser speed is to get closer to the hardware. I'm surprised no-one has done
>it. Perhaps no-one knows how to write assembler any more (or perhaps, like
>me, they just don't enjoy it).
>
>Michael Kay
>http://www.saxonica.com/
>
>
>
>-----------------------------------------------------------------
>The xml-dev list is sponsored by XML.org <http://www.xml.org>, an
>initiative of OASIS <http://www.oasis-open.org>
>
>The list archives are at http://lists.xml.org/archives/xml-dev/
>
>To subscribe or unsubscribe from this list use the subscription
>manager: <http://www.oasis-open.org/mlmanage/index.php>
>
>
>!DSPAM:4422b0a830071804284693!
>
>
>
