Automatic Generation of P2P Mappings between Sources Schemas

  • Karima Toumani
  • Hélene Jaudoin
  • Michel Schneider
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5722)

Abstract

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.

Keywords

Schema mappings description logics rewriting queries hypergraphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., et al.: The lowell database research self-assessment (2003)Google Scholar
  2. 2.
    Adjiman, P., Chatalic, P., Goasdoué, F., Rousset, M.-C., Simon, L.: SomeWhere in the semantic web. In: Fages, F., Soliman, S. (eds.) PPSWR 2005. LNCS, vol. 3703, pp. 1–16. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. University Press, Cambridge (2003)MATHGoogle Scholar
  4. 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. 5.
    Berge, C.: Hypergraphs (1989)Google Scholar
  6. 6.
    Eiter, T., Gottlob, G.: Identifying the minimal transversals of an hypergraph and related problems. SIAM of Computing 24(6), 1278–1304 (1995)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Goasdoué, F., Rousset, M.C.: Answering queries using views: A KRDB perspective for the semantic web. ACM Transactions on Internet Technology 4(3), 255–288 (2004)CrossRefGoogle Scholar
  8. 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
  9. 9.
    Halevy, A.Y., Ives, Z.G., Madhavan, J., Mork, P., Suciu, D., Tatarinov, I.: The piazza peer data management system. IEEE Transactions on Knowledge and Data Engineering 16(7), 787–798 (2004)CrossRefGoogle Scholar
  10. 10.
    Lenzerini, M.: Data integration: a theoretical perspective. In: PODS 2002, pp. 233–246. ACM Press, New York (2002)Google Scholar
  11. 11.
    Levy, A.Y.: Answering queries using views: A survey. The VLDB Journal 10, 270–294 (2001)CrossRefMATHGoogle Scholar
  12. 12.
    Sarma, A.D., Dong, X., Halevy, A.: Bootstrapping pay-as-you-go data integration systems. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp. 861–874. ACM, New York (2008)CrossRefGoogle Scholar
  13. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Karima Toumani
    • 1
  • Hélene Jaudoin
    • 2
  • Michel Schneider
    • 1
  1. 1.LIMOS, Blaise Pascal UniversityFrance
  2. 2.IRISA-ENSSATFrance

Personalised recommendations