Skip to main content

Reformulation-Based Query Answering for RDF Graphs with RDFS Ontologies

  • Conference paper
  • First Online:
The Semantic Web (ESWC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11503))

Included in the following conference series:

Abstract

Query answering in RDF knowledge bases has traditionally been performed either through graph saturation, i.e., adding all implicit triples to the graph, or through query reformulation, i.e., modifying the query to look for the explicit triples entailing precisely what the original query asks for. The most expressive fragment of RDF for which Reformulation-based query answering exists is the so-called database fragment [13], in which implicit triples are restricted to those entailed using an RDFS ontology. Within this fragment, query answering was so far limited to the interrogation of data triples (non-RDFS ones); however, a powerful feature specific to RDF is the ability to query data and schema triples together. In this paper, we address the general query answering problem by reducing it, through a pre-query reformulation step, to that solved by the query reformulation technique of [13]. We also report on experiments demonstrating the low cost of our reformulation algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    See discussion at https://team.inria.fr/cedar/rdfs-reasoning-experiments/.

  2. 2.

    https://franz.com/agraph/support/documentation/current/reasoner-tutorial.html.

  3. 3.

    https://www.stardog.com/docs/#_owl_rule_reasoning.

  4. 4.

    http://docs.openlinksw.com/virtuoso/rdfsparqlruleimpl.

References

  1. RDF 1.1 Concepts and Abstract Syntax. https://www.w3.org/TR/rdf11-concepts

  2. RDF 1.1 Semantics. https://www.w3.org/TR/rdf11-mt/#rdfs-entailment

  3. SPARQL 1.1 Query Language. https://www.w3.org/TR/sparql11-query/

  4. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  5. Adjiman, P., Goasdoué, F., Rousset, M.C.: SomeRDFS in the semantic web. JODS 8, 158–181 (2007)

    MATH  Google Scholar 

  6. Arenas, M., Gutierrez, C., Pérez, J.: Foundations of RDF databases. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 158–204. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03754-2_4

    Chapter  Google Scholar 

  7. Bishop, B., Kiryakov, A., Ognyanoff, D., Peikov, I., Tashev, Z., Velkov, R.: OWLIM: a family of scalable semantic repositories. Semant. Web 2(1), 33–42 (2011)

    Article  Google Scholar 

  8. Broekstra, J., Kampman, A.: Inferencing and truth maintenance in RDF schema. In: PSSS1 Workshop (2003). http://ceur-ws.org/Vol-89/broekstra-et-al.pdf

  9. Buron, M., Goasdoué, F., Manolescu, I., Mugnier, M.L.: Reformulation-based query answering for RDF graphs with RDFS ontologies. Research report, Inria, March 2019. https://hal.archives-ouvertes.fr/hal-02051413

  10. Bursztyn, D., Goasdoué, F., Manolescu, I.: Optimizing reformulation-based query answering in RDF. In: EDBT (2015)

    Google Scholar 

  11. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reasoning (JAR) 39(3), 385–429 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Goasdoué, F., Karanasos, K., Leblay, J., Manolescu, I.: View selection in semantic web databases. PVLDB 5(2) (2011). https://hal.inria.fr/inria-00625090v1

  13. Goasdoué, F., Manolescu, I., Roatis, A.: Efficient query answering against dynamic RDF databases. In: EDBT (2013). https://hal.inria.fr/hal-00804503v2

  14. Kaoudi, Z., Miliaraki, I., Koubarakis, M.: RDFS reasoning and query answering on top of DHTs. In: Sheth, A., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 499–516. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88564-1_32

    Chapter  Google Scholar 

  15. Lanti, D., Xiao, G., Calvanese, D.: Cost-driven ontology-based data access. In: d’Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10587, pp. 452–470. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68288-4_27

    Chapter  Google Scholar 

  16. Lutz, C., Seylan, İ., Toman, D., Wolter, F.: The combined approach to OBDA: taming role hierarchies using filters. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 314–330. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41335-3_20

    Chapter  Google Scholar 

  17. Neumann, T., Weikum, G.: The RDF-3X engine for scalable management of RDF data. VLDB J. 19, 91–113 (2010)

    Article  Google Scholar 

  18. Urbani, J., van Harmelen, F., Schlobach, S., Bal, H.: QueryPIE: backward reasoning for OWL Horst over very large knowledge bases. In: Aroyo, L., et al. (eds.) ISWC 2011. LNCS, vol. 7031, pp. 730–745. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25073-6_46

    Chapter  Google Scholar 

  19. Urbani, J., Piro, R., van Harmelen, F., Bal, H.E.: Hybrid reasoning on OWL RL. Semant. Web 5(6), 423–447 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the Inria Project Lab grant iCoda, a collaborative project between Inria and several major French media.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Maxime Buron , François Goasdoué , Ioana Manolescu or Marie-Laure Mugnier .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Buron, M., Goasdoué, F., Manolescu, I., Mugnier, ML. (2019). Reformulation-Based Query Answering for RDF Graphs with RDFS Ontologies. In: Hitzler, P., et al. The Semantic Web. ESWC 2019. Lecture Notes in Computer Science(), vol 11503. Springer, Cham. https://doi.org/10.1007/978-3-030-21348-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21348-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21347-3

  • Online ISBN: 978-3-030-21348-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics