메뉴 건너뛰기




Volumn , Issue , 2003, Pages 519-530

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

Author keywords

[No Author keywords available]

Indexed keywords

CHANGE DETECTION ALGORITHM; UNORDERED TREES; WEB PUBLISHING;

EID: 0344927764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2003.1260818     Document Type: Conference Paper
Times cited : (295)

References (23)
  • 1
    • 0038399343 scopus 로고    scopus 로고
    • HtmlDiff: A differencing tool for HTML documents
    • Student Project, Princeton University
    • E. Berk, "HtmlDiff: A Differencing Tool for HTML Documents", Student Project, Princeton University, http://www.htmldiff.com.
    • Berk, E.1
  • 3
    • 0003587590 scopus 로고    scopus 로고
    • XML path language (Xpath) version 1.0
    • November
    • J. Clark, S. DeRose, et al., "XML Path Language (Xpath) Version 1.0", November 1999, http://www.w3.org/TR/1999/REC-xpath-19991116.
    • (1999)
    • Clark, J.1    DeRose, S.2
  • 7
    • 0345673973 scopus 로고    scopus 로고
    • Concurrent versions system (CVS)
    • "Concurrent Versions System (CVS)", Free Software Foundation, http://www.gnu.org/manual/cvs-1.9.
    • Free Software Foundation
  • 9
    • 0002031139 scopus 로고    scopus 로고
    • The AT&T internet difference engine: Tracking and viewing changes on the web
    • January
    • F. Douglis, T. Ball, Y. F. Chen, E. Koutsofios, "The AT&T Internet Difference Engine: Tracking and Viewing Changes on the Web", World Wide Web, 1(1):27-44, January 1998.
    • (1998) World Wide Web , vol.1 , Issue.1 , pp. 27-44
    • Douglis, F.1    Ball, T.2    Chen, Y.F.3    Koutsofios, E.4
  • 11
    • 84976825385 scopus 로고
    • Algorithm for the longest common subsequence problem
    • October
    • D. S. Hirschberg, "Algorithm for the Longest Common Subsequence Problem", Journal of the ACM, 24(4): 664-675, October 1977.
    • (1977) Journal of the ACM , vol.24 , Issue.4 , pp. 664-675
    • Hirschberg, D.S.1
  • 13
    • 3042683723 scopus 로고    scopus 로고
    • Digest values for DOM (DOMHash) proposal
    • IBM Tokyo Research Laboratory
    • H. Maruyama, K. Tamura and R. Uramoto, "Digest values for DOM (DOMHash) proposal", IBM Tokyo Research Laboratory, http://www.trl.ibm.co.jp/projects/xml/domhash.htm, 1998.
    • (1998)
    • Maruyama, H.1    Tamura, K.2    Uramoto, R.3
  • 14
    • 0023012946 scopus 로고
    • An O(ND) difference algorithm and its variations
    • E. W. Myers, "An O(ND) Difference Algorithm and Its Variations", Algorithmica, 1(2): 251-266, 1986.
    • (1986) Algorithmica , vol.1 , Issue.2 , pp. 251-266
    • Myers, E.W.1
  • 15
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • S. M. Selkow, "The Tree-to-Tree Editing Problem", Information Processing Letters, 6(6):184-186, 1977.
    • (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.M.1
  • 16
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • K. C. Tai, "The Tree-to-Tree Correction Problem", Journal of the ACM, 26:485-495, 1979.
    • (1979) Journal of the ACM , vol.26 , pp. 485-495
    • Tai, K.C.1
  • 20
    • 0003551095 scopus 로고    scopus 로고
    • Extensible markup language (XML)
    • World Wide Web Consortium
    • "Extensible Markup Language (XML)", World Wide Web Consortium, http://www.w3.org/XML/.
  • 21
    • 0003509683 scopus 로고
    • A new editing based distance between unordered labeled trees
    • K. Zhang, "A New Editing based Distance between Unordered Labeled Trees", Combinatorial Pattern Matching, 1: 254-265, 1993.
    • (1993) Combinatorial Pattern Matching , vol.1 , pp. 254-265
    • Zhang, K.1
  • 22
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha, "Simple Fast Algorithms for the Editing Distance between Trees and Related Problems", SIAM Journal of Computing, 18(6): 1245-1262, 1989.
    • (1989) SIAM Journal of Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 23


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.