Advertisement
Published in:
2005 | OriginalPaper | Chapter
Multi-labeled Graph Matching – An algorithm Model for Schema Matching
Authors : Zhi Zhang, Haoyang Che, Pengfei Shi, Yong Sun, Jun Gu
Published in: Advances in Computer Science – ASIAN 2005. Data Management on the Web
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we treat the schema matching problem as a combinatorial problem. First, we propose an internal schema model, i.e., the multi-labeled graph, and transform schemas into multi-labeled graphs. Secondly, we discuss a generic graph similarity measure, and propose an optimization function based on multi-labeled graph similarity. Then, we cast schema matching problem into a multi-labeled graph matching problem, which is a classic combinational problem. Finally, we implement a greedy algorithm to find the feasible matching results.