Skip to Main content Skip to Navigation

BGP Query Answering against Dynamic RDF Databases

François Goasdoué 1, 2 Ioana Manolescu 1, 2 Alexandra Roatis 1, 2
2 OAK - Database optimizations and architectures for complex large data
Inria Saclay - Ile de France, LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : A promising method for efficiently querying RDF data consists of translating SPARQL queries into efficient RDBMS-style operations. However, answering SPARQL queries requires handling RDF reasoning, which must be implemented outside the relational engines that do not support it. We introduce the expressive database (DB) fragment of RDF for which we devise novel sound and complete techniques for answering Basic Graph Pattern (BGP) queries. Our techniques explore the two established approaches for handling RDF semantics, namely reformulation and saturation; we show how they cope with updates, a complex problem due to the rich RDF semantics. Our algorithms can be deployed on top of any RDBMS(-style) engine, and we experimentally study their performance trade-offs.
Document type :
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Alexandra Roatis Connect in order to contact the contributor
Submitted on : Friday, July 20, 2012 - 1:44:59 PM
Last modification on : Thursday, July 8, 2021 - 3:47:45 AM
Long-term archiving on: : Friday, December 16, 2016 - 2:38:47 AM


Files produced by the author(s)


  • HAL Id : hal-00719641, version 1



François Goasdoué, Ioana Manolescu, Alexandra Roatis. BGP Query Answering against Dynamic RDF Databases. [Research Report] RR-8018, INRIA. 2012, pp.42. ⟨hal-00719641⟩



Les métriques sont temporairement indisponibles