Subject: RE: [xsl] Comparing two xml documents From: "Ragulf Pickaxe" <jawxml@xxxxxxxxxxx> Date: Wed, 12 Mar 2003 23:31:06 +0000 |
Regards, Ragulf Pickaxe :)
It seems like you could save a lot of cycles by first sorting both documents by element name; then go through both lists at once using linear recursion, [does this mean you have to convert RTFs to node-sets? I'm not sure] comparing the "next" element in each sorted document, and updating the two "next" pointers according to which "next" node compares earlier.
This would give you O(n log n + m log m) time instead of O(n * m) where n and m are the number of nodes in the two documents. (I imagine xmlDiff does use a sort, but it was written using .NET, not XSLT.)
On the other hand, the 200KB limit may be just the max load they want you to put on their server. If you download xmlDiff and run it yourself it might work with your data.
If not, let me know... this is an interesting problem.
Lars
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
RE: [xsl] Comparing two xml documen, Lars Huttar | Thread | RE: [xsl] Comparing two xml documen, Lars Huttar |
Re: [xsl] Re: Comparing two xml doc, Robert P. J. Day | Date | [xsl] comparing timestamps, walter . crockett |
Month |