Redundancy elimination on RDF graphs in the presence of rules, constraints, and queries

Authors:
Reinhard Pichler;Axel Polleres;Sebastian Skritek;Stefan Woltran
Affiliations:
Technische Universität Wien;DERI, National University of Ireland, Galway;Technische Universität Wien;Technische Universität Wien
Venue:
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Year:
2010

Citing 12
Cited 1

On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Description logic programs: combining logic programs with description logic

WWW '03 Proceedings of the 12th international conference on World Wide Web
Foundations of semantic web databases

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPARQLing constraints for RDF

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Complexity results for answer set programming with bounded predicate arities and implications

Annals of Mathematics and Artificial Intelligence
Minimal Deductive Systems for RDF

ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Towards Rule-Based Minimization of RDF Graphs under Constraints

RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
The Expressive Power of SPARQL

ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Semantics and complexity of SPARQL

ACM Transactions on Database Systems (TODS)
On the Ostensibly Silent `W' in OWL 2 RL

RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes

ISWC '09 Proceedings of the 8th International Semantic Web Conference
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary

Web Semantics: Science, Services and Agents on the World Wide Web

Foundational aspects of semantic web optimization

PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

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), as well as 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.