메뉴 건너뛰기




Volumn 5870 LNCS, Issue PART 1, 2009, Pages 406-413

Complex schema match discovery and validation through collaboration

Author keywords

Collaboration; Complex schema matching; Large scale; Mini taxonomies; Tree mining

Indexed keywords

COLLABORATION; LARGE SCALE; MINI-TAXONOMIES; SCHEMA MATCHING; TREE MINING;

EID: 78650694563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05148-7_30     Document Type: Conference Paper
Times cited : (4)

References (12)
  • 1
    • 34247594820 scopus 로고    scopus 로고
    • Matching large schemas: Approaches and evaluation
    • Do, H.-H., Rahm, E.: Matching large schemas: Approaches and evaluation. Information Systems 32(6), 857-885 (2007)
    • (2007) Information Systems , vol.32 , Issue.6 , pp. 857-885
    • Do, H.-H.1    Rahm, E.2
  • 2
    • 0345566262 scopus 로고    scopus 로고
    • Learning to match ontologies on the Semantic Web
    • DOI 10.1007/s00778-003-0104-2
    • Doan, A., Madhavan, J., Dhamankar, R., Domingos, P., Halevy, A.Y.: Learning to match ontologies on the Semantic Web. VLDB J. 12(4), 303-319 (2003) (Pubitemid 37503689)
    • (2003) VLDB Journal , vol.12 , Issue.4 , pp. 303-319
    • Doan, A.H.1    Madhavan, J.2    Dhamankar, R.3    Domingos, P.4    Halevy, A.5
  • 3
    • 11244258150 scopus 로고    scopus 로고
    • Automatic Direct and Indirect Schema Mapping: Experiences and Lessons Learned
    • Embley, D.W., Xu, L., Ding, Y.: Automatic Direct and Indirect Schema Mapping: Experiences and Lessons Learned. ACM SIGMOD Record 33(4), 14-19 (2004)
    • (2004) ACM SIGMOD Record , vol.33 , Issue.4 , pp. 14-19
    • Embley, D.W.1    Xu, L.2    Ding, Y.3
  • 4
    • 33646431807 scopus 로고    scopus 로고
    • S-Match: An Algorithm and an Implementation of Semantic Matching
    • First European Semantic Web Symposium, ESWS 2004 Heraklion, Crete, Greece, May 10-12, 2004 Proceedings
    • Giunchiglia, F., Shvaiko, P., Yatskevich, M.: S-Match: an Algorithm and an Implementation of Semantic Matching. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol. 3053, pp. 61-75. Springer, Heidelberg (2004) (Pubitemid 38699466)
    • (2004) LECTURE NOTES in COMPUTER SCIENCE , Issue.3053 , pp. 61-75
    • Giunchiglia, F.1    Shvaiko, P.2    Yatskevich, M.3
  • 5
    • 12244253353 scopus 로고    scopus 로고
    • Discovering complex matchings across web query interfaces: A correlation mining approach
    • He, B., Chang, K.C.-C., Han, J.: Discovering complex matchings across web query interfaces: a correlation mining approach. In: KDD, pp. 148-157 (2004)
    • (2004) KDD , pp. 148-157
    • He, B.1    Chang, K.C.-C.2    Han, J.3
  • 6
    • 0038494895 scopus 로고    scopus 로고
    • Net Cot: Translating relational schemas to XML schemas using semantic constraints
    • Lee, D., Mani, M., Chiu, F., Chu, W.W.: Net Cot: Translating relational schemas to XML schemas using semantic constraints. In: CIKM (2002)
    • CIKM (2002)
    • Lee, D.1    Mani, M.2    Chiu, F.3    Chu, W.W.4
  • 7
    • 1142303690 scopus 로고    scopus 로고
    • RONDO: A Programming Platform for Generic Model Management
    • Melnik, S., Rahm, E., Bernstein, P.A.: RONDO: A Programming Platform for Generic Model Management. In: SIGMOD, pp. 193-204 (2003)
    • (2003) SIGMOD , pp. 193-204
    • Melnik, S.1    Rahm, E.2    Bernstein, P.A.3
  • 8
    • 0035657983 scopus 로고    scopus 로고
    • A survey of approaches to automatic schema matching
    • Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB J. 10(4), 334-350 (2001)
    • (2001) VLDB J. , vol.10 , Issue.4 , pp. 334-350
    • Rahm, E.1    Bernstein, P.A.2
  • 9
    • 57049169779 scopus 로고    scopus 로고
    • Automatic extraction of structurally coherent minitaxonomies
    • Saleem, K., Bellahsene, Z.: Automatic extraction of structurally coherent minitaxonomies. In: ER (2008)
    • ER (2008)
    • Saleem, K.1    Bellahsene, Z.2
  • 12
    • 24044516553 scopus 로고    scopus 로고
    • Efficiently Mining Frequent Embedded Unordered Trees
    • Zaki, M.J.: Efficiently Mining Frequent Embedded Unordered Trees. Fundamenta Informaticae 66(1-2), 33-52 (2005)
    • (2005) Fundamenta Informaticae , vol.66 , Issue.1-2 , pp. 33-52
    • Zaki, M.J.1


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