Automatic Generation of P2P Mappings between Sources Schemas
This paper deals with the problem of automatic generation of mappings between data sources schemas, by exploiting existing centralized mappings between sources schemas and a global ontology. We formalize this problem in the settings of description logics and we show that it can be reduced to a problem of rewriting queries using views. We identify two subproblems: the first one is equivalent to a well known problem of computing maximally contained rewritings while the second problem constitutes a new instance of the query rewriting problem in which the goal is to compute minimal rewritings that contain a given query. We distinguish two cases to solve this latter problem: (i) for languages closed under negation, the problem is reduced to the classic problem of rewriting queries using views, and (ii) for languages with the property of structural subsumption, a technique based on hypergraphs is proposed to solve it.
KeywordsSchema mappings description logics rewriting queries hypergraphs
Unable to display preview. Download preview PDF.
- 1.Abiteboul, S., et al.: The lowell database research self-assessment (2003)Google Scholar
- 4.Beeri, C., Levy, A.Y., Rousset, M.C.: Rewriting queries using views in description logics. In: PODS 1997, pp. 99–108. ACM Press, New York (1997)Google Scholar
- 5.Berge, C.: Hypergraphs (1989)Google Scholar
- 8.Halevy, A.Y., Ives, Z.G., Suciu, D., Tatarinov, I.: Schema mediation in peer data management systems. In: ICDE, pp. 505–516 (2003)Google Scholar
- 10.Lenzerini, M.: Data integration: a theoretical perspective. In: PODS 2002, pp. 233–246. ACM Press, New York (2002)Google Scholar
- 13.Teege, G.: Making the difference: A subtraction operation for description logics. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) Principles of Knowledge Representation and Reasoning: Proc. of the 4th International Conference (KR 1994), pp. 540–550. Morgan Kaufmann Publishers, San Francisco (1994)CrossRefGoogle Scholar