Fast and simple XML tree differencing by sequence alignment

Proceedings of the 2006 ACM Symposium on Document Engineering, DocEng 2006

Volumn 2006, Issue , 2006, Pages 75-84

  Lindholm, Tancred ^a   Kangasharju, Jaakko ^a   Tarkoma, Sasu ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Differencing; Move; Ordered tree; Sequence alignment; XML

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; PROBLEM SOLVING; TREES (MATHEMATICS);

DIFFERENCING; EXECUTION TIME; ORDERED TREES; SEQUENCE ALIGNMENT;

XML;

EID: 34247399581     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1166160.1166183     Document Type: Conference Paper

References (31)

1. L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. In Seventh International Symposium on String Processing Information Retrieval (SPIRE'00), pages 39-48, Los Alamitos, CA, USA, Sept. 2000. IEEE Computer Society.
2. S. S. Chawathe. Comparing hierarchical data in external memory. In VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases, pages 90-101, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
3. S. S. Chawathe and H. Garcia-Molina. Meaningful change detection in structured data. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, pages 26-37. ACM Press, May 1997.
4. S. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom. Change detection in hierarchically structured information. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pages 493-504, June 1996.
5. G. Cobena, S. Abiteboul, and A. Marian. Detecting changes in XML documents. In 18th International Conference on Data Engineering, pages 41-52, Feb. 2002.
6. J.-I. Gailly and M. Adler, zlib 1.1.4 Manual, Mar. 2002.
7. J. Kangasharju and T. Lindholm. A sequence-based type-aware interface for XML processing. In M. H. Hamza, editor, Ninth IASTED International Conference on Internet and Multimedia Systems and Applications, pages 83-88. ACTA Press, Feb. 2005.
8. A. Laux and L. Martin. XUpdate - XML Update Language. XML:DB Initiative for XML Databases, Sept. 2000. Working draft.
9. T. Lindholm. A 3-way merging algorithm for synchronizing ordered trees -the 3DM merging and differencing tool for XML. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Espoo, Finland, Sept. 2001.
10. T. Lindholm, J. Kangasharju, and S. Tarkoma. A hybrid approach to optimistic file system directory tree synchronization. In Fourth International ACM Workshop on Data Engineering for Wireless and Mobile Access, June 2005.
11. S. Y. Lu. A tree-to-tree distance and its application to cluster analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1(2):219-224, 1979.
12. J. MacDonald. File system support for delta compression. Master's thesis, UC Berkeley, May 2000.
13. E. W. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1(2):251-266, 1986.
14. M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Department of Computer Science, Harvard University, 1981.
15. S. Rönnau, J. Scheffczyk, and U. M. Borghoff. Towards XML version control of office documents. In A CM Symposium on Document Engineering, pages 10-19, New York, NY, USA, Nov. 2005. ACM Press.
16. S. M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):184-186, Dec. 1977.
17. D. Shapira and J. A. Storer. Edit distance with move operations. In A. Apostolico and M. Takeda, editors, 13th Annual Symposium on Combinatorial Pattern Matching, volume 2373 of Lecture Notes in Computer Science, pages 85-98, Fukuoka, Japan, July 2002. Springer-Verlag.
18. Sun Microsystems. OpenOffice.org XML File Format 1.0, Dec. 2002.
19. K.-C. Tai. The tree-to-tree correction problem. Journal of the ACM, 26(3):422-433, July 1979.
20. W. F. Tichy. The string-to-string correction problem with block moves. ACM Transactions on Computer Systems, 2(4):309-321, 1984.
21. A. Tridgell. Efficient Algorithms for Sorting and Synchronization. PhD thesis, Australian National University, Canberra, Australia, Feb. 1999.
22. Y. Wang, D. J. DeWitt, and J.-Y. Cai. X-Diff: an effective change detection algorithm for XML documents. In 19th International Conference on Data Engineering, pages 519-530, Mar. 2003.
23. World Wide Web Consortium, Cambridge, Massachusetts, USA. XML Path Language (XPath) 1.0, Nov. 1999. W3C Recommendation.
24. World Wide Web Consortium, Cambridge, Massachusetts, USA. XHTML 1.0 The Extensible HyperText Markup Language (Second Edition), Aug. 2002. W3C Recommendation.
25. World Wide Web Consortium, Cambridge, Massachusetts, USA. Scalable Vector Graphics (SVG) 1.1 Specification, Jan. 2003. W3C Recommendation.
26. World Wide Web Consortium, Cambridge, Massachusetts, USA. Document Object Model (DOM) Level 3 Core Specification, Apr. 2004. W3C Recommendation.
27. World Wide Web Consortium, Cambridge, Massachusetts, USA. Extensible Markup Language (XML) 1.0, 3rd edition, Feb. 2004. W3C Recommendation.
28. World Wide Web Consortium, Cambridge, Massachusetts, USA. XML Information Set, 2nd edition, Feb. 2004. W3C Recommendation.
29. World Wide Web Consortium, Cambridge, Massachusetts, USA. XQuery 1.0 and XPath 2.0 Data Model (XDM), Nov. 2005. W3C Candidate Recommendation.
30. World Wide Web Consortium, Cambridge, Massachusetts, USA. Remote Events for XML (REX) 1.0, Feb. 2006. W3C Working Draft.
31. K. Zhang and D. Shasha. Fast algorithm for the unit cost editing distance between trees. Journal of Algorithms, 11(4):581-621, Dec. 1990.