X-Diff: an effective change detection algorithm for XML documents

Wang, Y.; DeWitt, David J.; Cai, Jin-Yi

doi:10.1109/icde.2003.1260818

Cited by 223 publications

(193 citation statements)

References 17 publications

(24 reference statements)

Supporting

Mentioning

183

Contrasting

Unclassified

Order By: Relevance

“…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%

See 1 more Smart Citation

A Novel Approach for Web Page Change Detection System

Khandagale¹,

Halkarnikar²

2010

IJCTE

View full text Add to dashboard Cite

Abstract-Users are often not only interested in the current web page contents but also in changes in it. In this paper we describes web page change detection system based on Signature of Node corresponds to HTML pages. In this proposal first HTML document is filtered into XML structure document and then transforms XML pages to trees using DOM. The node signature comparison algorithm is developed to compare the trees of old web page and modified web page to find the changes in the web page. This system highlights changes of content i.e. deletion and addition of text and attribute changes i.e. font change, caption change, color change etc. and highlight the changed part in red color and displays to the user. This algorithm gets result faster as it does not search the sub tree if that sub tree does not have any changes.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Section: Literature Surveymentioning

confidence: 99%

A Novel Approach for Web Page Change Detection System

Khandagale¹,

Halkarnikar²

2010

IJCTE

View full text Add to dashboard Cite

show abstract

“…In [19] an algorithm is proposed to detect changes in XML documents. As a mean to improve change results, unordered tree representation of the analyzed models were used.…”

Section: Related Workmentioning

confidence: 99%

On Differencing Object-Oriented Formal Specifications.

Taibi¹,

Alam²,

Abdullah³

2010

JOT

View full text Add to dashboard Cite

Requirements specification is a collaborative activity that involves several developers specifying the requirements elicited through several stakeholders. Operation-base merging allows combining specifications using the information available about their state as well as their evolution or change. Thus, leading to a more precise, accurate and efficient merging. Differencing specifications is a tedious, complicated, and a crucial process needed for operation-based merging of specifications resulting from collaboration. An approach for differencing Object-Oriented formal specifications is proposed in this paper. The difference is modeled as a set of primitive operations and is produced based on the matching results of specifications' elements. These matchings are calculated based on an approach employing elements' syntactic and structural similarities. The proposed differencing approach is empirically validated.

show abstract

“…However, in practice, the ordering among siblings is not always of great importance to users and is not always available [2]. Unordered trees have shown the capability of identifying interesting relations due to not being constrained by sibling conditions [3,4]. This distinct property of unordered trees, however, makes the process of mining frequent subtrees more challenging in comparison to ordered trees.…”

Section: Introductionmentioning

confidence: 99%

BEST: An Efficient Algorithm for Mining Frequent Unordered Embedded Subtrees

Chowdhury

Nayak

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents an algorithm for mining unordered embedded subtrees using the balanced-optimal-search canonical form (BOCF). A tree structure guided scheme based enumeration approach is defined using BOCF for systematically enumerating the valid subtrees only. Based on this canonical form and enumeration technique, the balanced optimal search embedded subtree mining algorithm (BEST) is introduced for mining embedded subtrees from a database of labelled rooted unordered trees. The extensive experiments on both synthetic and real datasets demonstrate the efficiency of BEST over the two state-of-the-art algorithms for mining embedded unordered subtrees, SLEUTH and U3.

show abstract

X-Diff: an effective change detection algorithm for XML documents

Abstract: Abstract

Cited by 223 publications

References 17 publications

A Novel Approach for Web Page Change Detection System

A Novel Approach for Web Page Change Detection System

On Differencing Object-Oriented Formal Specifications.

BEST: An Efficient Algorithm for Mining Frequent Unordered Embedded Subtrees

Contact Info

Product

Resources

About