| Hisham |
| Member |
|
| Lebanon |
|
|
| None Specified |
|
| Wednesday, September 9, 2009 |
| Tuesday, September 22, 2009 2:51:23 PM |
15
[0.08% of all post / 0.00 posts per day] |
|
|
btw are you using X-Diff algorithm or a modified version of it ? ^^
|
k i have been testing diffdog lately and I am not very impressed.
Tree Edit Distance is NP-Hard, so at first I was under the impression that DiffDog was doing Constrained Tree Edit Distance (which belongs to P). So I was impressed by the performance since the best algorithm for the problem takes more than cubic time.
Now I see that DiffDog is doing just another heuristic :( and that explains the relatively fast performance.
Feed diffdog the following two files:
<a>
<b>
<c>aa<\c>
<\b>
<\a>
and
<b>
<c>aa<\c>
<\b>
It can't detect that the second file was obtained from the first by deleting the root element...
|
|
ok thanks for the reply
|
Can someone please tell us what algorithm is being used for the comparison of XML files in DiffDOG? Is it a published work?
thanks
|
|
what I need is an API to integrate this with other applications
|
|
