Sciweavers

Share
RR
2010
Springer

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries

11 years 3 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog rules) and constraints, (in the form of so-called tuple-generating dependencies), and with respect to queries (ranging from conjunctive queries up to more complex ones, particularly covering features of SPARQL, such as union, negation, or filters). To this end, we investigate the influence of several problem parameters (like restrictions on the size of the rules, the constraints, and/or the queries) on the complexity of detecting redundancy. The main result of this paper is a fine-grained complexity analysis of both graph and rule minimisation in various settings.
Reinhard Pichler, Axel Polleres, Sebastian Skritek
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where RR
Authors Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran
Comments (0)
books