Abstract
Defining and composing mappings are fundamental operations required in any data sharing architecture (e.g. data warehouse, data integration). Mapping composition is used to generate new mappings from existing ones and is useful when no direct mapping is available. The complexity of mapping composition depends on the amount of syntactic and semantic information in the mapping. The composition of mappings has proven to be inefficient to compute in many situations unless the mappings are simplified to binary relationships that represent “similarity” between concepts. Our contribution is an algorithm for composing metadata mappings that capture explicit semantics in terms of binary relationships. Our approach allows the hard cases of mapping composition to be detected and semi-automatically resolved, and thus reduces the manual effort required during composition. We demonstrate how the mapping composition algorithm is used to produce a direct mapping between schemas from independently produced schema-to-ontology mappings. An experimental evaluation shows that composing semantic mappings results in a more accurate composition result compared to composing mappings as morphisms.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11914853_71.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Bernstein, P.: Applying Model Management to Classical Meta Data Problems. In: CIDR (2003)
Dhamankar, R., Lee, Y., Doan, A., Halevy, A., Domingos, P.: iMAP: Discovering Complex Mappings between Database Schemas. In: SIGMOD Conference 2004, pp. 383–394 (2004)
Do, H.H., Rahm, E.: COMA - A System for Flexible Combination of Schema Matching Approaches. In: VLDB, pp. 610–621 (2002)
Dragut, E., Lawrence, R.: Composing mappings between schemas using a reference ontology. In: ODBASE, pp. 783–800 (2004)
Euzenat, J.: An API for ontology alignment. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 698–712. Springer, Heidelberg (2004)
Fagin, R., Kolaitis, P., Popa, L., Tan, W.: Composing schema mappings: Second-order dependencies to the rescue. In: PODS, pp. 83–94 (2004)
Giunchiglia, F., Shvaiko, P., Yatskevich, M.: S-Match: an Algorithm and an Implementation of Semantic Matching. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol. 3053, pp. 61–75. Springer, Heidelberg (2004)
Halevy, A.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)
Hirsch, R., Hodkinson, I.: Relation algebras by games. North-Holland, Amsterdam (2002)
Kotis, K., Vouros, G.: The HCONE Approach to Ontology Merging. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol. 3053, pp. 137–151. Springer, Heidelberg (2004)
Madhavan, J., Bernstein, P., Doan, A., Halvey, A.: Corpus-based Schema Matching. In: ICDE (2005)
Madhavan, J., Bernstein, P., Domingos, P., Halevy, A.: Representing and reasoning about mappings between domain models. In: AAAI, pp. 80–86 (2002)
Madhavan, J., Bernstein, P., Rahm, E.: Generic Schema Matching with Cupid. In: VLDB, pp. 49–58 (2001)
Melnik, S., Rahm, E., Bernstein, P.: Rondo: A Programming Platform for Generic Model Management. In: SIGMOD Conference 2003, pp. 193–204 (2003)
Popa, L., Velegrakis, Y., Miller, R., Hernndez, M., Fagin, R.: Translating web data. In: VLDB, pp. 598–609 (2002)
Pottinger, R., Bernstein, P.: Merging Models Based on Given Correspondences. In: VLDB, pp. 826–873 (2003)
Rahm, E., Bernstein, P.: A survey of approaches to automatic schema matching. VLDB Journal 10(4), 334–350 (2001)
Spaccapietra, S., Parent, C.: View integration: A step forward in solving structural conflicts. IEEE Trans. Knowl. Data Eng. 6(2), 258–274 (1994)
Tarski, A.: On the calculus of relations. J. Symbolic Logic. 6, 73–89 (1941)
Tarski, A.: Some methodological results concerning the calculus of relations. J. Symbolic Logic. 18, 188–189 (1953)
Xu, L., Embley, D.: Discovering Direct and Indirect Matches for Schema Elements. In: DASFAA, pp. 39–46 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dragut, E., Lawrence, R. (2006). Reducing the Cost of Validating Mapping Compositions by Exploiting Semantic Relationships. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11914853_54
Download citation
DOI: https://doi.org/10.1007/11914853_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48287-1
Online ISBN: 978-3-540-48289-5
eBook Packages: Computer ScienceComputer Science (R0)