메뉴 건너뛰기




Volumn , Issue , 2009, Pages 3-12

Efficient change control of XML documents

Author keywords

Office documents; Tree to tree correction; Version control; XML diff; XML merge

Indexed keywords

CHANGE CONTROL; DIFFERENCING ALGORITHM; HIGH QUALITY; INFORMATION ARCHITECTURES; OFFICE DOCUMENTS; SEQUENCE ALIGNMENTS; TREE-TO-TREE CORRECTION; VERSION CONTROL; VERSIONING; WORK-FLOWS;

EID: 70450225455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1600193.1600197     Document Type: Conference Paper
Times cited : (26)

References (30)
  • 2
    • 42749094100 scopus 로고    scopus 로고
    • Learning probabilistic models of tree edit distance
    • M. Bernard, L. Boyer, A. Habrard, and M. Sebban. Learning probabilistic models of tree edit distance. Pattern Recogn., 41(8):2611-2629, 2008.
    • (2008) Pattern Recogn. , vol.41 , Issue.8 , pp. 2611-2629
    • Bernard, M.1    Boyer, L.2    Habrard, A.3    Sebban, M.4
  • 3
    • 18444373554 scopus 로고    scopus 로고
    • A survey on tree edit distance and related problems
    • P. Bille. A survey on tree edit distance and related problems. Theor. Comput. Sci., 337(1-3):217-239, 2005.
    • (2005) Theor. Comput. Sci. , vol.337 , Issue.1-3 , pp. 217-239
    • Bille, P.1
  • 5
    • 0031167952 scopus 로고    scopus 로고
    • Meaningful change detection in structured data
    • S. S. Chawathe and H. Garcia-Molina. Meaningful change detection in structured data. SIGMOD Rec., 26(2):26-37, 1997.
    • (1997) SIGMOD Rec. , vol.26 , Issue.2 , pp. 26-37
    • Chawathe, S.S.1    Garcia-Molina, H.2
  • 7
    • 0345861203 scopus 로고    scopus 로고
    • New algorithm for ordered tree-to-tree correction problem
    • W. Chen. New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms, 40(2):135 - 158, 2001.
    • (2001) Journal of Algorithms , vol.40 , Issue.2 , pp. 135-158
    • Chen, W.1
  • 9
    • 0003213917 scopus 로고    scopus 로고
    • XML path language (XPath)
    • version 1.0., Nov.
    • S. DeRose and J. Clark. XML path language (XPath) version 1.0. W3C recommendation, W3C, Nov. 1999. http://www.w3.org/TR/1999/REC-xpath-19991116.
    • (1999) W3C Recommendation
    • Derose, S.1    Clark, J.2
  • 10
    • 1542340262 scopus 로고    scopus 로고
    • Merging xml files: A new approach providing intelligent merge of XML data sets
    • R. L. Fontaine. Merging xml files: a new approach providing intelligent merge of xml data sets. In Proceedings of XML Europe 2002, 2002.
    • (2002) Proceedings of XML Europe 2002
    • Fontaine, R.L.1
  • 13
    • 0029309548 scopus 로고
    • Alignment of trees - An alternative to tree edit
    • T. Jiang, L. Wang, and K. Zhang. Alignment of trees - an alternative to tree edit. Theoretical Computer Science, 143(1):137 - 148, 1995.
    • (1995) Theoretical Computer Science , vol.143 , Issue.1 , pp. 137-148
    • Jiang, T.1    Wang, L.2    Zhang, K.3
  • 16
    • 0023012946 scopus 로고
    • An o(nd) difference algorithm and its variations
    • E. W. Myers. An o(nd) difference algorithm and its variations. Algorithmica, 1:251-266, 1986.
    • (1986) Algorithmica , vol.1 , pp. 251-266
    • Myers, E.W.1
  • 18
    • 53149143265 scopus 로고    scopus 로고
    • XHTML™ 1.0 the extensible hypertext markup language (second edition)
    • Aug.
    • S. Pemberton. XHTML™ 1.0 the extensible hypertext markup language (second edition). W3C recommendation, W3C, Aug. 2002. http://www.w3.org/TR/2002/ REC-xhtml1-20020801.
    • (2002) W3C Recommendation
    • Pemberton, S.1
  • 24
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • S. M. Selkow. The tree-to-tree editing problem. Inf. Process. Lett., 6(6):184-186, 1977.
    • (1977) Inf. Process. Lett. , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.M.1
  • 25
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, 1979.
    • (1979) J. ACM , vol.26 , Issue.3 , pp. 422-433
    • Tai, K.-C.1
  • 26
    • 84963877855 scopus 로고    scopus 로고
    • An efficient bottom-up distance between trees
    • G. Valiente. An efficient bottom-up distance between trees. In SPIRE, pages 212-219, 2001.
    • (2001) SPIRE , pp. 212-219
    • Valiente, G.1
  • 27
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.
    • (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 29
    • 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 J. Comput., 18(6):1245-1262, 1989.
    • (1989) SIAM J. Comput. , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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