@inproceedings{eb1ba989d9b14b59ae410b1acf09a56c,
title = "Schema matching based on labeled graph",
abstract = "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 = "Constraint satisfaction problem, H-coloring problem, Labeled graph, Schema homomorphism, Schema maching",
author = "Guitao Cao and Zhi Zhang",
year = "2009",
doi = "10.1109/CISE.2009.5364747",
language = "英语",
isbn = "9781424445073",
series = "Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009",
booktitle = "Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009",
note = "2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 ; Conference date: 11-12-2009 Through 13-12-2009",
}