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:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 10
Cited 3

Schema equivalence in heterogeneous systems: bridging theory and practice

Information Systems - Special issue on extending database technology
Managing semantic heterogeneity in databases: a theoretical prospective

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Formal definition of mappings in a data base

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Learning to Match the Schemas of Data Sources: A Multistrategy Approach

Machine Learning
Knowledge Representation and Reasonings Based on Graph Homomorphism

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Generic Schema Matching with Cupid

Proceedings of the 27th International Conference on Very Large Data Bases
A Model Theory for Generic Schema Management

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
A survey of approaches to automatic schema matching

The VLDB Journal — The International Journal on Very Large Data Bases
Dichotomies for classes of homomorphism problems involving unary functions

Theoretical Computer Science
Generic Model Management: Concepts And Algorithms (Lecture Notes in Computer Science)

Generic Model Management: Concepts And Algorithms (Lecture Notes in Computer Science)

A multi-level matching algorithm for combining similarity measures in ontology integration

ODBIS'05/06 Proceedings of the First and Second VLDB conference on Ontologies-based databases and information systems
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
Schema homomorphism: an algebraic framework for schema matching

ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, based on universal algebra, we propose a meta-meta structure for schema. This definition has a distinctive feature: it is able to describe any particular style of schemas, and transforms a schema and other matching information into a finite structure over specific signature. Then, we formulize SMP as a schema homomorphism problem, and prove that SMP is equivalent to finding a semantic homomorphism from one schema to another. These results lead to the main contribution of this paper: an algebraic framework for SMP. Thirdly, we show a classification of schema matching based on the algebraic framework.