Efficient query answering against dynamic RDF databases

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 database (DB) fragment of RDF, going beyond the expressive power of previously studied RDF fragments. We devise novel sound and complete techniques for answering Basic Graph Pattern (BGP) queries within the DB fragment of RDF, exploring the two established approaches for handling RDF semantics, namely reformulation and saturation. In particular, we focus on handling database updates within each approach and propose a method for incrementally maintaining the saturation; updates raise specific difficulties due to the rich RDF semantics. Our techniques are designed to be deployed on top of any RDBMS(-style) engine, and we experimentally study their performance trade-offs.

Original languageEnglish
Title of host publicationAdvances in Database Technology - EDBT 2013
Subtitle of host publication16th International Conference on Extending Database Technology, Proceedings
Pages299-310
Number of pages12
DOIs
Publication statusPublished - 2 May 2013
Externally publishedYes
Event16th International Conference on Extending Database Technology, EDBT 2013 - Genoa, Italy
Duration: 18 Mar 201322 Mar 2013

Publication series

NameACM International Conference Proceeding Series

Conference

Conference16th International Conference on Extending Database Technology, EDBT 2013
Country/TerritoryItaly
CityGenoa
Period18/03/1322/03/13

Keywords

  • RDF fragments
  • query answering
  • reasoning

Fingerprint

Dive into the research topics of 'Efficient query answering against dynamic RDF databases'. Together they form a unique fingerprint.

Cite this