Minimising RDF Graphs under Rules and Constraints Revisited

Provided by: RWTH Aachen University
Topic: Data Management
Format: PDF
Based on practical observations on rule-based inference on RDF (Resource Description Framework) data, the authors study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) and constraints (in the form of so-called tuple-generating dependencies). To this end, they investigate the influence of several problem parameters (like restrictions on the size of the rules and/or the constraints) on the complexity of detecting redundancy. The main result of this paper is a fine-grained complexity analysis of both graph and rule minimization in various settings.

Find By Topic