Performance oriented schema matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4653 LNCS, Issue , 2007, Pages 844-853

  Saleem, Khalid ^a   Bellahsene, Zohra ^a   Hunt, Ela ^b  

^a LIRMM   (France)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL METHODS; ERROR ANALYSIS; ROBUST CONTROL; SEMANTICS; XML;

DATA SOURCES; MEDIATED SCHEMA; SCHEMA MATCHING;

DATA TRANSFER;

EID: 38049082961     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74469-6_82     Document Type: Conference Paper

References (11)

1. Batini, C., Lenzerini, M., Navathe, S.B.: A comparitive analysis of methodologies for database schema integration. ACM Computing Surveys 18(4), 323-364 (1986)
2. Bernstein, P.A., Melnik, S., Petropoulos, M., Quix, C.: Industrial-strength schema matching. SIGMOD Record 33(4), 38-43 (2004)
3. Do, H.-H., Rahm, E.: Matching large schemas: Approaches and evaluation. Information Systems 32(6), 857-885 (2007)
4. 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)
5. 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)
6. Jhingran, A.: Enterprise information mashups: Integrating information, simply - keynote address. In: VLDB (2006)
7. Mork, P., Bernstein, P.A.: Adapting a generic match algorithm to align ontologies of human anatomy. In: ICDE (2004)
8. Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB J. 10(4), 334-350 (2001)
9. Shvaiko, P., Euzenat, J.: A survey of schema-based matching approaches. J. Data Semantics IV, 146-171 (2005)
10. Su, W., Wang, J., Lochovsky, F.: Holistic query interface matching using parallel schema matching. In: ICDE (2006)
11. Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae 65, 1-20 (2005)