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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alagić, S., Bernstein, P.A.: A model theory for generic schema management. LNCS, vol. 2497, pp. 228–246. Springer, Heidelberg
Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. In: Proc. Vision Interface, pp. 82–88 (2000)
Doan, A., Domingos, P., Halevy, A.: Learning to Match the Schemas of Data Sources: A Multistrategy Approach. Machine Learning (50), 279–301 (2003); Kluwer Academic Publishers Manufactured in The Netherlands
Dubhashi, D.P.: Complexity of Logical Theories. Department of Computer Science, University of Aarhus. BRICS LS-95-5, ISSN 1395-2048 (1995)
Federa, T., Madelaineb, F., Stewartc, I.A.: Dichotomies for classes of homomorphism problems involving unary functions. Theoretical Computer Science (314), 1–43 (2004)
Hell, P.: Algorithmic aspects of graph homomorphisms, Combinatorics. London Math. Society Lecture Note Series, vol. 307, pp. 239–276. Cambridge University Press, Cambridge (2003)
Hull, R.: Managing semantic heterogeneity in databases: A theoretical perspective. In: PODS 1997, pp. 51–61 (1997)
Madhavan, J., Bernstein, P.A., Rahm, E.: Generic schema matching with cupid. In: VLDB 2001 (2001)
Melnik, S.: Generic model management-concepts and algorithms. LNCS, vol. 2967. Springer, Heidelberg (2004)
Miller, R.J., Ioannidis, Y.E., Ramakrishnan, R.: Schema equivalence in heterogeneous systems: Bridging theory and practice. Information Systems 19(1), 3–31 (1994)
Mugnier, M.L.: Knowledge representation and reasonings based on graph homomorphism. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 172–192. Springer, Heidelberg (2000)
Paolini, P., Pelagatti, G.: Formal Definition of Mappings in a Data Base. In: Proc. ACM SIGMOD Intl. Conf. on Management of Data, pp. 40–46 (1977)
Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal (10), 334–350 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Che, H., Shi, P., Sun, Y., Gu, J. (2005). An Algebraic Framework for Schema Matching. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_66
Download citation
DOI: https://doi.org/10.1007/11563952_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29227-2
Online ISBN: 978-3-540-32087-6
eBook Packages: Computer ScienceComputer Science (R0)