Schema Matching Based on Labeled Graph

Schema matching is a critical problem for achieving semantic interoperability between heterogeneous information sources, and plays a key role in database applications. The aim of schema matching problem (SMP) is to find semantic correspondences between two schemas and indeed a combinatorial problem. In this paper, we use the labeled graph as the internal schema model, so SMP can be formulized as a semantic homomorphism from a labeled graph to another. Moreover, the homomorphism problem is equivalent to the constraint satisfaction problem (CSP) and H-coloring problem, so SMP can be reformulated, and an example is followed to show this process. Keywords-schema maching; schema homomorphism; labeled graph; constraint satisfaction problem ; H-coloring problem

[1]  Erhard Rahm,et al.  COMA - A System for Flexible Combination of Schema Matching Approaches , 2002, VLDB.

[2]  Pengfei Shi,et al.  Formulation Schema Matching Problem for Combinatorial Optimization Problem , 2006, Int. J. Interoperability Bus. Inf. Syst..

[3]  Zhi Zhang,et al.  An Algebraic Framework for Schema Matching , 2005, Informatica.

[4]  Tova Milo,et al.  Using Schema Matching to Simplify Heterogeneous Data Translation , 1998, VLDB.

[5]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[6]  Erhard Rahm,et al.  Generic Schema Matching with Cupid , 2001, VLDB.

[7]  Chris Clifton,et al.  SEMINT: A tool for identifying attribute correspondences in heterogeneous databases using neural networks , 2000, Data Knowl. Eng..

[8]  Pavol Hell,et al.  Algorithmic aspects of graph homomorphisms , 2003 .

[9]  P. Jeavons.  Algebraic structures in combinatorial problems , 2001 .

[10]  Pavel Shvaiko,et al.  Iterative schema-based semantic matching , 2006 .

[11]  Y VardiMoshe,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction , 1999 .

[12]  Sergey Melnik,et al.  Generic Model Management , 2004, Lecture Notes in Computer Science.

[13]  Pedro M. Domingos,et al.  Learning to Match the Schemas of Data Sources: A Multistrategy Approach , 2003, Machine Learning.

[14]  Philip A. Bernstein,et al.  A Model Theory for Generic Schema Management , 2001, DBPL.

[15]  Luciano Serafini,et al.  A SAT-Based Algorithm for Context Matching , 2003, CONTEXT.

[16]  Marie-Laure Mugnier,et al.  Knowledge Representation and Reasonings Based on Graph Homomorphism , 2000, ICCS.