Abduction from logic program: semantics and complexity
Theoretical Computer Science
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Some Notes on Knowledge Assimilation in Deductive Databases
ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Transitive Reduction for Social Network Analysis and Visualization
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Optimizing RDF storage removing redundancies: an algorithm
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Query reformulation with constraints
ACM SIGMOD Record
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
On the foundations of computing deltas between RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Combining RDF and part of OWL with rules: semantics, decidability, complexity
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
REDD: an algorithm for redundancy detection in RDF models
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Redundancy elimination on RDF graphs in the presence of rules, constraints, and queries
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Foundational aspects of semantic web optimization
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
| Hi-index | 0.00 |
The Resource Description Framework (RDF) is a cornerstone of the Semantic Web. Due to its few and elementary language constructs, RDF data can become large and contain redundant information. So far, techniques for eliminating redundancy rely on the generic notion of lean graphs. We propose a user-specific minimization technique based on Datalog rules, enabling a user to specify the structures in an RDF graph that are not relevant for an application and therefore are deleted, while still by means of the rules retaining the possibility to reconstruct the deleted data. We set this scenario on top of constraints to ensure data consistency, i.e. if an RDF graph satisfies some constraints before minimization, these constraints must be also satisfied afterwards. The problem is decidable but already for a restricted case intractable. In addition we give a fragment of the minimization problem which can be solved in polynomial time.