skip to main content
10.1145/2187836.2187924acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

On directly mapping relational databases to RDF and OWL

Published:16 April 2012Publication History

ABSTRACT

Mapping relational databases to RDF is a fundamental problem for the development of the Semantic Web. We present a solution, inspired by draft methods defined by the W3C where relational databases are directly mapped to RDF and OWL. Given a relational database schema and its integrity constraints, this direct mapping produces an OWL ontology, which, provides the basis for generating RDF instances. The semantics of this mapping is defined using Datalog. Two fundamental properties are information preservation and query preservation. We prove that our mapping satisfies both conditions, even for relational databases that contain null values. We also consider two desirable properties: monotonicity and semantics preservation. We prove that our mapping is monotone and also prove that no monotone mapping, including ours, is semantic preserving. We realize that monotonicity is an obstacle for semantic preservation and thus present a non-monotone direct mapping that is semantics preserving.

References

  1. W3C OWL Working Group. OWL 2 Web ontology language document overview. W3C Recommendation 27 October 2009, http://www.w3.org/TR/owl2-overview/.Google ScholarGoogle Scholar
  2. D2R Server. Publishing Relational Databases on the Semantic Webriptsize http://www4.wiwiss.fu-berlin.de/bizer/d2r-server/.Google ScholarGoogle Scholar
  3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Angles and C. Gutierrez. The expressive power of sparql. In ISWC, pages 114--129, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Arenas, A. Bertails, E. Prud'hommeaux, and J. Sequeda. Direct mapping of relational data to RDF. W3C Working Draft 20 September 2011, http://www.w3.org/TR/rdb-direct-mapping/.Google ScholarGoogle Scholar
  6. A. Bertails, and E. Prud'hommeaux. Interpreting relational databases in the RDF domain In K-CAP, pages 129--136, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Eql-lite: Effective first-order query processing in description logics. In IJCAI, pages 274--279, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. F. Cerbah. Mining the Content of Relational Databases to Learn Ontologies with Deeper Taxonomies In Web Intelligence, pages 553--557, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. F. Donini, M. Lenzerini, D. Nardi, W. Nutt, and A. Schaerf. An epistemic operator for description logics. Artif. Intell., 100(1--2):225--274, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. M. Donini, D. Nardi, and R. Rosati. Description logics of minimal knowledge and negation as failure. ACM TOCL, 3(2):177--225, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Grimm and B. Motik. Closed world reasoning in the semantic web through epistemic operators. In OWLED, 2005.Google ScholarGoogle Scholar
  12. S. Harris and A. Seaborne. SPARQL 1.1 query language. W3C Working Draft 12 May 2011, http://www.w3.org/TR/sparql11-query/.Google ScholarGoogle Scholar
  13. B. He, M. Patel, Z. Zhang, and K. C.-C. Chang. Accessing the deep web. Commun. ACM, 50:94--101, May 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Mehdi, S. Rudolph, and S. Grimm. Epistemic querying of OWL knowledge bases. In ESWC (1), pages 397--409, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Motik, I. Horrocks, and U. Sattler. Bridging the gap between OWL and relational databases. J. Web Sem., 7(2):74--89, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Pérez, M. Arenas, and C. Gutierrez. Semantics and complexity of SPARQL. ACM Trans. Database Syst., 34(3), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. E. Prud'hommeaux and A. Seaborne. SPARQL query language for RDF. W3C Recommendation 15 January 2008, http://www.w3.org/TR/rdf-sparql-query/.Google ScholarGoogle Scholar
  18. R. Reiter. On integrity constraints. In TARK, pages 97--111, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. F. Sequeda, M. Arenas, and D. P. Miranker. On Directly Mapping Relational Databases to RDF and OWL(Extended Version). arXiv:1202.3667 {cs.DB} (February 2012), http://arxiv.org/abs/1202.3667.Google ScholarGoogle Scholar
  20. J. F. Sequeda, S. H. Tirmizi, O. Corcho, and D. P. Miranker. Survey of directly mapping sql databases to the semantic web. Knowledge Eng. Review, 26(4): 445--486 (2011) Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. I. Seylan, E. Franconi, and J. De Bruijn. Effective query rewriting with ontologies over DBoxes. In IJCAI, pages 923--929, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Tao, E. Sirin, J. Bao, and D. L. McGuinness. Integrity constraints in OWL. In AAAI, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. S. H. Tirmizi, J. Sequeda, and D. P. Miranker. Translating SQL Applications to the Semantic Web. In DEXA, pages 450--464, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On directly mapping relational databases to RDF and OWL

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            WWW '12: Proceedings of the 21st international conference on World Wide Web
            April 2012
            1078 pages
            ISBN:9781450312295
            DOI:10.1145/2187836

            Copyright © 2012 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 16 April 2012

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate1,899of8,196submissions,23%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader