Talks and Poster Presentations (with Proceedings-Entry):
R. Pichler, A. Polleres, S. Skritek, S. Woltran:
"Minimising RDF Graphs under Rules and Constraints Revisited";
Talk: 4th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2010),
Bueons Aires, Argentina;
05-17-2010
- 05-20-2010; in: "Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management",
A. H. F. Laender, L. V. S. Lakshmanan (ed.);
CEUR Workshop Proceedings,
619
(2010),
ISSN: 1613-0073.
English abstract:
Based on practical observations on rule-based inference on RDF data, we 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, we 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 ne-grained complexity analysis of both graph and rule minimisation in various settings.
Created from the Publication Database of the Vienna University of Technology.