Proceedings 18th International Conference on Data Engineering
DOI: 10.1109/icde.2002.994696
|View full text |Cite
|
Sign up to set email alerts
|

Detecting changes in XML documents

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
266
0
2

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 261 publications
(268 citation statements)
references
References 14 publications
0
266
0
2
Order By: Relevance
“…It finds matchings between common large subtrees of the two documents and propagates these matchings [15]. Following the BULD algorithm, we distinguish the following four phases during the mapping stage.…”
Section: Mapping Model Entitiesmentioning
confidence: 99%
“…It finds matchings between common large subtrees of the two documents and propagates these matchings [15]. Following the BULD algorithm, we distinguish the following four phases during the mapping stage.…”
Section: Mapping Model Entitiesmentioning
confidence: 99%
“…In [1], [2] and [3], various different algorithms are described for detecting changes in XML documents. The algorithm in [3] is based on finding and then extracting the matching nodes from the two trees that are being compared.…”
Section: Literature Surveymentioning
confidence: 99%
“…Matching of nodes is based on comparing signatures (functions of node content and children) and order of occurrence in common order subsequences of nodes. The works in [1] and [2] transform the pages to trees according to the XML structure and use edit scripting to compare them. The strength of these algorithms lies in their low time-complexity, which is in the order of O (nlogn).…”
Section: Literature Surveymentioning
confidence: 99%
“…In the former case, to access and modify temporal XML documents, DOM can be extended to automatically capture temporal information (and indeed, we have implemented such functionality in τDOM). It is also possible to capture transaction time information in the documents through change analysis, as discussed above and elsewhere [4,11].…”
Section: Review Of Related Workmentioning
confidence: 99%
“…Chawathe et al [8] described a model for representing changes in semi-structured data and a language for querying over these changes. For example, the diff based approach [4,11] focuses on an efficient way to store time-varying data and can be used to help detect transaction time changes in the document at the physical level. Buneman et al [6] provide another means to store a single copy of an element that occurs in many snapshots.…”
Section: Review Of Related Workmentioning
confidence: 99%