Multi-labeled graph matching - An algorithm model for schema matching

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

Volumn 3818 LNCS, Issue , 2005, Pages 90-103

  Zhang, Zhi ^a   Che, Haoyang ^b   Shi, Pengfei ^a   Sun, Yong ^c   Gu, Jun ^c  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b INSTITUTE OF SOFTWARE   (China)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATABASE SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS;

CLASSIC COMBINATIONAL PROBLEM; MULTI-LABELED GRAPHS; SCHEMA MATCHING;

GRAPH THEORY;

EID: 33744920343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596370_9     Document Type: Conference Paper

References (17)

1. Berlin, J., Motro, A.: Autoplex: Automated Discovery of Content for Virtual Databases. CoopIS 2001, LNCS 2172:108-122.
2. Bouquet, P., Magnini, B., Serafini, L., Zanobini, S.: A SAT-Based Algorithm for Context Matching. LNAI 2680: 66-79.
3. Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. Springer-Verlag, ICCBR 2003, LNAI 2689: 80-95.
4. Cohen, W. W., Ravikumar, P., Fienberg, S. E.: A Comparison of String Distance Metrics for Name-Matching Tasks. 2003, IJCAI-03: 3-78.
5. Do, H. H., Rahm, E.; COMA - A system for flexible combination of schema matching approaches. VLDB 2002.
6. Do, H. H., Melnik, S., Rahm, E.: Comparison of schema matching evaluations. Web Databases and Web Services 2002, LNCS 2593: 221-237.
7. Doan, A., Domingos, P., Halevy, A.: Learning to Match the Schemas of Data Sources: A Multistrategy Approach. Machine Learning. Kluwer Academic Publishers Manufactured in The Netherlands, 2003 (50):279-301.
8. Giunchiglia, P., Shvaiko, P., Yatskcvich, M.: S-Match: An algorithm and an implementation of semantic matching. In Proceedings of ESWS'04.
9. Madhavan, J., Bernstein, P. A., Rahm, E.: Generic Schema Matching with Cupid. 27th VLDB Conference.
10. Melnik, S.: Generic model management - concepts and algorithms, Springer, 2004, LNCS 2967.
11. Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm. ICDE 2002
12. Miller, R. J., Haas, L.M., Hernández, M.A.: Clio: Schema Mapping as Query Discovery. Proc. VLDB 2000.
13. Pedersen, T., Patwardhan, S., Patwardhan, S.: WordNet::Similarity - Measuring the Relatedness of Concepts. Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004, San Jose, CA.
14. Rahm, E., Bernstein, P. A.; On matching schemas automatically. Microsoft Research, Redmon, WA. Technical Report MSR-TR-2001-17, 2001.
15. Rahm, E., Bernstein, P. A.: A survey of approaches to automatic schema matching, The VLDB Journal, 2001(10): 334-350.
16. S. Sorlin, C. Solnon.: Reactive Tabu Search for Measuring Graph Similarity. GbRPR 2005: 172-182
17. Zhang, Z., Che, H. Y., Shi, P. F., Sun, Y., Gu, J.: An algebraic framework for schema matching. WAIM 2005, LNCS 3739.