Fuzzy Constraint-based Schema Matching Formulation

The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy constraint optimization problem FCOP. In particular, we propose the use of the fuzzy constraint optimization problem as a framework to model and formalize the schema matching problem. By formalizing the SMP as a FCOP, we gain many benefits. First, we could express it as a combinatorial optimization problem with a set of soft constraints which are able to cope with uncertainty in schema matching. Second, the actual algorithm solution becomes independent of the concrete graph model, allowing us to change the model without affecting the algorithm by introducing a new level of abstraction. Moreover, we could discover complex matches easily. Finally, we could make a trade-off between schema matching performance aspects.

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

[2]  Erhard Rahm,et al.  Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.

[3]  Luigi Palopoli,et al.  A graph-based approach for extracting terminological properties from information sources with heterogeneous formats , 2004, Knowledge and Information Systems.

[4]  Erhard Rahm,et al.  Quickmig: automatic schema matching for data migration projects , 2007, CIKM '07.

[5]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[6]  Pedro M. Domingos,et al.  Reconciling schemas of disparate data sources: a machine-learning approach , 2001, SIGMOD '01.

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

[8]  Mitesh Patel,et al.  Structured databases on the web: observations and implications , 2004, SGMD.

[9]  Marko Smiljanic,et al.  XML schema matching : balancing efficiency and effectiveness by means of clustering , 2006 .

[10]  R. Balakrishnan,et al.  A textbook of graph theory , 1999 .

[11]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[12]  Angela Bonifati,et al.  The Spicy Project: A New Approach to Data Matching , 2006, SEBD.

[13]  Pedro M. Domingos,et al.  Learning to map between structured representations of data , 2002 .

[14]  Fausto Giunchiglia,et al.  Semantic Matching: Algorithms and Implementation , 2007, J. Data Semant..

[15]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[16]  Zohra Bellahsene,et al.  An Indexing Structure for Automatic Schema Matching , 2007, ICDE Workshops.

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

[18]  Alon Y. Halevy,et al.  Data integration with uncertainty , 2007, The VLDB Journal.