Reformulation-Based Query Answering for RDF Graphs with RDFS Ontologies
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 , 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 . We also report on experiments demonstrating the low cost of our reformulation algorithm.
KeywordsQuery answering Query reformulation RDF RDFS
This work is supported by the Inria Project Lab grant iCoda, a collaborative project between Inria and several major French media.
- 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/
- 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_4CrossRefGoogle 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)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
- 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_32CrossRefGoogle Scholar
- 19.Urbani, J., Piro, R., van Harmelen, F., Bal, H.E.: Hybrid reasoning on OWL RL. Semant. Web 5(6), 423–447 (2014)Google Scholar
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.