Schema homomorphism: an algebraic framework for schema matching

Authors:
Zhi Zhang;Haoyang Che;Pengfei Shi;Yong Sun;Jun Gu
Affiliations:
Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Shanghai, China;Institute of Software, The Chinese Academy of Sciences, Beijing, China;Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science, Science & Technology University of Hong Kong, Hong Kong, China;Department of Computer Science, Science & Technology University of Hong Kong, Hong Kong, China
Venue:
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Year:
2005

Citing 3
Cited 0

A survey of approaches to automatic schema matching

The VLDB Journal — The International Journal on Very Large Data Bases
Multi-labeled graph matching: an algorithm model for schema matching

ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
An algebraic framework for schema matching

WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formal framework for SMP is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, we propose a formal definition of schema matching that is named multivalent matching, i.e., an individual of source schema can be associated with a set of individuals of target schema. Second, we develop the algebraic framework of multivalent matching that is called schema homomorphism and propose the algorithm model of SMP. Then, we discuss the relations between match cardinality and variants of schema homomorphism.