Towards XML version control of office documents

Rönnau, Sebastian; Scheffczyk, Jan; Borghoff, Uwe M.

doi:10.1145/1096601.1096606

Cited by 24 publications

(16 citation statements)

References 21 publications

(29 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even when they are comparable they often suffer from excessive runtime or enormously large edit scripts. Other comparative studies have found these shortcomings as well [27,15]. Both studies have also found that XyDiff [21] is the only serious contender.…”

Section: Index Structure Comparisonmentioning

confidence: 98%

RWS-Diff

Finis

Raiber

Augsten

et al. 2013

Proceedings of the 22nd ACM International Conference on Conference on Information &Amp; Knowledge Management - CIKM '13

View full text Add to dashboard Cite

The problem of generating a cost-minimal edit script between two trees has many important applications. However, finding such a cost-minimal script is computationally hard, thus the only methods that scale are approximate ones. Various approximate solutions have been proposed recently. However, most of them still show quadratic or worse runtime complexity in the tree size and thus do not scale well either. The only solutions with log-linear runtime complexity use simple matching algorithms that only find corresponding subtrees as long as these subtrees are equal. Consequently, such solutions are not robust at all, since small changes in the leaves which occur frequently can make all subtrees that contain the changed leaves unequal and thus prevent the matching of large portions of the trees. This problem could be avoided by searching for similar instead of equal subtrees but current similarity approaches are too costly and thus also show quadratic complexity. Hence, currently no robust log-linear method exists.We propose the random walks similarity (RWS) measure which can be used to find similar subtrees rapidly. We use this measure to build the RWS-Diff algorithm that is able to compute an approximately cost-minimal edit script in log-linear time while having the robustness of a similaritybased approach. Our evaluation reveals that random walk similarity indeed increases edit script quality and robustness drastically while still maintaining a runtime comparable to simple matching approaches.

show abstract

Section: Index Structure Comparisonmentioning

confidence: 98%

RWS-Diff

Finis

Raiber

Augsten

et al. 2013

Proceedings of the 22nd ACM International Conference on Conference on Information &Amp; Knowledge Management - CIKM '13

View full text Add to dashboard Cite

show abstract

“…Rönnau et al analyzed requirements for version control of XML documents produced by word processors or spreadsheets in [14]. For a broader selection of algorithms and more in-depth information on the individual algorithms one can consult the survey from Peters [12] on change detection in XML trees or the survey by Bille [1] on solutions for the general tree edit distance problem.…”

Section: Related Workmentioning

confidence: 99%

Fine-grained change detection in structured text documents

Dohrn

Riehle

2014

Proceedings of the 2014 ACM Symposium on Document Engineering

View full text Add to dashboard Cite

Detecting and understanding changes between document revisions is an important task. The acquired knowledge can be used to classify the nature of a new document revision or to support a human editor in the review process. While purely textual change detection algorithms offer fine-grained results, they do not understand the syntactic meaning of a change. By representing structured text documents as XML documents we can apply tree-to-tree correction algorithms to identify the syntactic nature of a change.Many algorithms for change detection in XML documents have been propsed but most of them focus on the intricacies of generic XML data and emphasize speed over the quality of the result. Structured text requires a change detection algorithm to pay close attention to the content in text nodes, however, recent algorithms treat text nodes as black boxes.We present an algorithm that combines the advantages of the purely textual approach with the advantages of tree-totree change detection by redistributing text from non-overlapping common substrings to the nodes of the trees. This allows us to not only spot changes in the structure but also in the text itself, thus achieving higher quality and a fine-grained result in linear time on average. The algorithm is evaluated by applying it to the corpus of structured text documents that can be found in the English Wikipedia.

show abstract

“…From [23], where several XML diff approaches were analyzed, we decided to choose JXydiff [4] which is a Java tool for detecting changes in XML documents. We chose this for the following reasons: 1) It has the main features to get XML differences: can manage all kinds of XML nodes, can detect move and update operations and is based on tree oriented algorithms.…”

Section: Versioning Modulesmentioning

confidence: 99%

An XQuery-based version extension of an XML native database

Rosado

Márquez

Sánchez

2009

Proceedings of the 2009 EDBT/ICDT Workshops

View full text Add to dashboard Cite

The goal of this paper is to show our experience in the design of an extension to an XML native database in order to add in a native way version features. Due to the lineal nature of time, XML timestamped solutions for the management of XML versions have difficulty in supporting non-linear versioning, and their implementations are scarce and not very portable. From our technique described in [6,7], which allows us to manage branch versioning, we have developed our versioning system focusing on its high portability and platform independence properties. To achieve this, our versioning system is based exclusively on XML technology. The system is composed by XQuery modules, so that this allows its use not only in an XQuery engine but also in an XQuerysupport XML native database. To test it, the modules have been integrated in an eXist XML native database, an XML difference tool is used to observe the changes made between versions, and the eXist web interface has been extended to make the management of XML versions easier.

show abstract

Towards XML version control of office documents

Cited by 24 publications

References 21 publications

RWS-Diff

RWS-Diff

Fine-grained change detection in structured text documents

An XQuery-based version extension of an XML native database

Contact Info

Product

Resources

About