X-Diff: An Effective Change Detection Algorithm for XML Documents. Wang, Y., DeWitt, D. J., & Cai, J. In pages 519-530. doi abstract bibtex XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is important to Internet query systems, search engines, and continuous query systems. Previous work in change detection on XML, or other hierarchically structured documents, used an ordered tree model, in which left-to-right order among siblings is important and it can affect the change result. This paper argues that an unordered model (only ancestor relationships are significant) is more suitable for most database applications. Using an unordered model, change detection is substantially harder than using the ordered model, but the change result that it generates is more accurate. This paper proposes X-Diff, an effective algorithm that integrates key XML structure characteristics with standard tree-to-tree correction techniques. The algorithm is analyzed and compared with XyDiff, a published XML diff algorithm. An experimental evaluation on both algorithms is provided.
@inproceedings{ wan03,
crossref = {icde2003},
author = {Yuan Wang and David J. DeWitt and Jin-yi Cai},
title = {X-Diff: An Effective Change Detection Algorithm for XML Documents},
pages = {519-530},
topic = {xdiff[0.9]},
doi = {10.1109/ICDE.2003.1260818},
abstract = {XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is important to Internet query systems, search engines, and continuous query systems. Previous work in change detection on XML, or other hierarchically structured documents, used an ordered tree model, in which left-to-right order among siblings is important and it can affect the change result. This paper argues that an unordered model (only ancestor relationships are significant) is more suitable for most database applications. Using an unordered model, change detection is substantially harder than using the ordered model, but the change result that it generates is more accurate. This paper proposes X-Diff, an effective algorithm that integrates key XML structure characteristics with standard tree-to-tree correction techniques. The algorithm is analyzed and compared with XyDiff, a published XML diff algorithm. An experimental evaluation on both algorithms is provided.}
}
Downloads: 0
{"_id":{"_str":"53ff72c27c90ec6e13001216"},"__v":0,"authorIDs":[],"author_short":["Wang, Y.","DeWitt, D.<nbsp>J.","Cai, J."],"bibbaseid":"wang-dewitt-cai-xdiffaneffectivechangedetectionalgorithmforxmldocuments","bibdata":{"downloads":0,"role":"author","bibbaseid":"wang-dewitt-cai-xdiffaneffectivechangedetectionalgorithmforxmldocuments","type":"inproceedings","topic":"xdiff[0.9]","title":"X-Diff: An Effective Change Detection Algorithm for XML Documents","pages":"519-530","key":"wan03","id":"wan03","doi":"10.1109/ICDE.2003.1260818","crossref":"icde2003","bibtype":"inproceedings","bibtex":"@inproceedings{ wan03,\n crossref = {icde2003},\n author = {Yuan Wang and David J. DeWitt and Jin-yi Cai},\n title = {X-Diff: An Effective Change Detection Algorithm for XML Documents},\n pages = {519-530},\n topic = {xdiff[0.9]},\n doi = {10.1109/ICDE.2003.1260818},\n abstract = {XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is important to Internet query systems, search engines, and continuous query systems. Previous work in change detection on XML, or other hierarchically structured documents, used an ordered tree model, in which left-to-right order among siblings is important and it can affect the change result. This paper argues that an unordered model (only ancestor relationships are significant) is more suitable for most database applications. Using an unordered model, change detection is substantially harder than using the ordered model, but the change result that it generates is more accurate. This paper proposes X-Diff, an effective algorithm that integrates key XML structure characteristics with standard tree-to-tree correction techniques. The algorithm is analyzed and compared with XyDiff, a published XML diff algorithm. An experimental evaluation on both algorithms is provided.}\n}","author_short":["Wang, Y.","DeWitt, D.<nbsp>J.","Cai, J."],"author":["Wang, Yuan","DeWitt, David J.","Cai, Jin-yi"],"abstract":"XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is important to Internet query systems, search engines, and continuous query systems. Previous work in change detection on XML, or other hierarchically structured documents, used an ordered tree model, in which left-to-right order among siblings is important and it can affect the change result. This paper argues that an unordered model (only ancestor relationships are significant) is more suitable for most database applications. Using an unordered model, change detection is substantially harder than using the ordered model, but the change result that it generates is more accurate. This paper proposes X-Diff, an effective algorithm that integrates key XML structure characteristics with standard tree-to-tree correction techniques. The algorithm is analyzed and compared with XyDiff, a published XML diff algorithm. An experimental evaluation on both algorithms is provided."},"bibtype":"inproceedings","biburl":"http://dret.net/biblio/dret.bib","creationDate":"2014-08-28T18:19:46.239Z","downloads":0,"keywords":[],"search_terms":["diff","effective","change","detection","algorithm","xml","documents","wang","dewitt","cai"],"title":"X-Diff: An Effective Change Detection Algorithm for XML Documents","year":null,"dataSources":["mL7NKvaepNEWFcMvG"]}