메뉴 건너뛰기




Volumn 4831 LNCS, Issue , 2007, Pages 196-211

Structural similarity evaluation between XML documents and DTDs

Author keywords

DTD; Semi structured XML based data; Structural similarity; Tree edit distance; XML grammar

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA PROCESSING; TREES (MATHEMATICS);

EID: 38349081267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76993-4_17     Document Type: Conference Paper
Times cited : (15)

References (36)
  • 1
    • 84976791819 scopus 로고    scopus 로고
    • Aho, A., Hirschberg, D., Ullman, J.: Bounds on the Complexity of the Longest Common Subsequence Problem. ACM J. 23(1), 1-12 (1976)
    • Aho, A., Hirschberg, D., Ullman, J.: Bounds on the Complexity of the Longest Common Subsequence Problem. ACM J. 23(1), 1-12 (1976)
  • 2
    • 4544282701 scopus 로고
    • Approximate String Matching with Don't Care Characters
    • Akatsu, T.: Approximate String Matching with Don't Care Characters. Information Processing Letters 55, 235-239 (1995)
    • (1995) Information Processing Letters , vol.55 , pp. 235-239
    • Akatsu, T.1
  • 3
    • 2442437492 scopus 로고    scopus 로고
    • Measuring the Structural Similarity among XML Documents and DTDs
    • Technical Report, University of Genova
    • Bertino E., et al.: Measuring the Structural Similarity among XML Documents and DTDs, Technical Report, University of Genova (2002), http://www.disi.unige.it/person/MesitiM
    • (2002)
    • Bertino, E.1
  • 7
    • 0030157266 scopus 로고    scopus 로고
    • Change Detection in Hierarchically Structured Information
    • Chawathe, S., et al.: Change Detection in Hierarchically Structured Information. In: SIGMOD, pp. 493-504 (1996)
    • (1996) SIGMOD , pp. 493-504
    • Chawathe, S.1
  • 10
    • 29144484106 scopus 로고    scopus 로고
    • A methodology for clustering XML documents by structure
    • Dalamagas, T., Cheng, T., Winkel, K., Sellis, T.: A methodology for clustering XML documents by structure. Inf. Syst. 31(3), 187-228 (2006)
    • (2006) Inf. Syst , vol.31 , Issue.3 , pp. 187-228
    • Dalamagas, T.1    Cheng, T.2    Winkel, K.3    Sellis, T.4
  • 11
    • 0033293496 scopus 로고    scopus 로고
    • XML-QL: A Query Language for XML
    • Deutsch, A., et al.: XML-QL: A Query Language for XML. Computer Networks 31(11-16), 1155-1169 (1999)
    • (1999) Computer Networks , vol.31 , Issue.11-16 , pp. 1155-1169
    • Deutsch, A.1
  • 12
    • 85087242589 scopus 로고    scopus 로고
    • th VLDB Conf., Honk Kong, pp. 610-621 (2002)
    • th VLDB Conf., Honk Kong, pp. 610-621 (2002)
  • 13
    • 0034825478 scopus 로고    scopus 로고
    • Reconciling Schemas of Disparate Data Sources: A Machine Learning Approach
    • Doan, A., Domingos, P., Halevy, A. Y.: Reconciling Schemas of Disparate Data Sources: A Machine Learning Approach. In: ACM SIGMOD, pp. 509-520 (2001)
    • (2001) ACM SIGMOD , pp. 509-520
    • Doan, A.1    Domingos, P.2    Halevy, A.Y.3
  • 14
    • 0242621784 scopus 로고    scopus 로고
    • Detecting Structural Similarities between XML Documents
    • Flesca, S., et al.: Detecting Structural Similarities between XML Documents. In: WebDB, pp. 55-60 (2002)
    • (2002) WebDB , pp. 55-60
    • Flesca, S.1
  • 15
  • 17
    • 0001421462 scopus 로고
    • Fast Parallel and Serial Approximate String Matching
    • Landau, G.M., Vishkin, U.: Fast Parallel and Serial Approximate String Matching. Journal of Algorithms 10, 157-169 (1989)
    • (1989) Journal of Algorithms , vol.10 , pp. 157-169
    • Landau, G.M.1    Vishkin, U.2
  • 18
    • 21144462574 scopus 로고
    • Information Retrieval Based on Conceptual Distance in IS-A Hierarchies
    • Lee, J.H., Kim, M.H., Lee, Y.J.: Information Retrieval Based on Conceptual Distance in IS-A Hierarchies. Journal of Documentation 49(2), 188-207 (1993)
    • (1993) Journal of Documentation , vol.49 , Issue.2 , pp. 188-207
    • Lee, J.H.1    Kim, M.H.2    Lee, Y.J.3
  • 19
    • 0037481024 scopus 로고    scopus 로고
    • XClust: Clustering XML Schemas for Effective Integration
    • Lee, M., et al.: XClust: Clustering XML Schemas for Effective Integration. In: CIKM, pp. 292-299 (2002)
    • (2002) CIKM , pp. 292-299
    • Lee, M.1
  • 20
    • 0001116877 scopus 로고
    • Binary Codes Capable of Correcting Deletions, Insertions and Reversals
    • Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Sov. Phys. Dokl. 6, 707-710 (1966)
    • (1966) Sov. Phys. Dokl , vol.6 , pp. 707-710
    • Levenshtein, V.1
  • 22
    • 0036205389 scopus 로고    scopus 로고
    • Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching
    • Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching. In: Proc. of the 18th ICDE Conference, pp. 117-128 (2002)
    • (2002) Proc. of the 18th ICDE Conference , pp. 117-128
    • Melnik, S.1    Garcia-Molina, H.2    Rahm, E.3
  • 23
    • 0023012946 scopus 로고
    • An O(N D) Difference Algorithm and Its Variations
    • Myers, E.: An O(N D) Difference Algorithm and Its Variations. Algorithmica 1(2), 251-266 (1986)
    • (1986) Algorithmica , vol.1 , Issue.2 , pp. 251-266
    • Myers, E.1
  • 25
    • 38349001849 scopus 로고    scopus 로고
    • Technologies for Digital Multimedia Communications: An Evolution Analysis of MPEG Standards
    • Pereira, F.: Technologies for Digital Multimedia Communications: An Evolution Analysis of MPEG Standards. China Communications Journal, 8-19 (2006)
    • (2006) China Communications Journal , pp. 8-19
    • Pereira, F.1
  • 27
    • 27244432105 scopus 로고    scopus 로고
    • Sanz, I., Mesiti, M., Guerrini, G., Berlanga Lavori, R.: Approximate Subtree Identification in Heterogeneous XML Documents Collections. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, 3671, pp. 192-206. Springer, Heidelberg (2005)
    • Sanz, I., Mesiti, M., Guerrini, G., Berlanga Lavori, R.: Approximate Subtree Identification in Heterogeneous XML Documents Collections. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol. 3671, pp. 192-206. Springer, Heidelberg (2005)
  • 28
    • 0008785214 scopus 로고    scopus 로고
    • Similarity Search in XML Data Using Cost-based Query Transformations
    • Schlieder, T.: Similarity Search in XML Data Using Cost-based Query Transformations. In: WebDB, pp. 19-24 (2001)
    • (2001) WebDB , pp. 19-24
    • Schlieder, T.1
  • 30
    • 0018491659 scopus 로고    scopus 로고
    • Tai, K.C.: The Tree-to-Tree correction problem. ACM J. 26, 422-433 (1979)
    • Tai, K.C.: The Tree-to-Tree correction problem. ACM J. 26, 422-433 (1979)
  • 31
    • 0015960104 scopus 로고
    • The String-to-String correction problem
    • Wagner, J., Fisher, M.: The String-to-String correction problem. J. of the ACM (21), 168-173 (1974)
    • (1974) J. of the ACM , vol.21 , pp. 168-173
    • Wagner, J.1    Fisher, M.2
  • 33
    • 35348885237 scopus 로고    scopus 로고
    • August 10, Consortiumhttp://www.w3.org/DOM
    • WWW Consortium, The Document Object Model (August 10, 2006), http://www.w3.org/DOM
    • (2006) The Document Object Model
  • 34
    • 0024889169 scopus 로고
    • Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
    • Zhang, K., Shasha, D.: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems. SIAM J. 18(6), 1245-1262 (1989)
    • (1989) SIAM J , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 35
    • 0003193164 scopus 로고
    • Approximate Tree Matching in the Presence of Variable Length Don't Cares
    • Zhang, K., Shasha, D., Wang, J.: Approximate Tree Matching in the Presence of Variable Length Don't Cares. J. of Algorithms 16(1), 33-66 (1994)
    • (1994) J. of Algorithms , vol.16 , Issue.1 , pp. 33-66
    • Zhang, K.1    Shasha, D.2    Wang, J.3


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