Affiliations: [a] Department of Computer Science, University of Oxford, Oxford, UK. georg.gottlob@cs.ox.ac.uk | [b] School of Informatics, University of Edinburgh, Edinburgh, UK. apieris@inf.ed.ac.uk | [c] Institute of Information Systems, Vienna University of Technology, Vienna, Austria. simkus@dbai.tuwien.ac.at
Correspondence:
[*]
Address for correspondence: Department of Computer Science, University of Oxford, Oxford, UK
Abstract: It is realistic to assume that a database management system provides access to the active domain via built-in relations. Therefore, databases that include designated predicates that hold the active domain, which we call product databases, form a natural notion that deserves our attention. An important issue then is to look at the consequences of product databases for the expressiveness and complexity of central existential rule languages. We focus on guarded-based existential rules, and we investigate the impact of product databases on their expressive power and complexity. We show that the queries expressed via (frontier-)guarded rules gain in expressiveness, and in fact, they have the same expressive power as Datalog. On the other hand, there is no impact on the expressiveness of the queries specified via weakly-(frontier-)guarded rules since they are powerful enough to explicitly compute the predicates needed to access the active domain. We also observe that there is no impact on the complexity of the query languages in question.
