License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2018.4
URN: urn:nbn:de:0030-drops-85950
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8595/
Go to the corresponding LIPIcs Volume Portal


Ahmetaj, Shqiponja ; Ortiz, Magdalena ; Simkus, Mantas

Rewriting Guarded Existential Rules into Small Datalog Programs

pdf-format:
LIPIcs-ICDT-2018-4.pdf (0.5 MB)


Abstract

The goal of this paper is to understand the relative expressiveness of the query language in which queries are specified by a set of guarded (disjunctive) tuple-generating dependencies (TGDs) and an output (or 'answer') predicate. Our main result is to show that every such query can be translated into a polynomially-sized (disjunctive) Datalog program if the maximal number of variables in the (disjunctive) TGDs is bounded by a constant. To overcome the challenge that Datalog has no direct means to express the existential quantification present in TGDs, we define a two-player game that characterizes the satisfaction of the dependencies, and design a Datalog query that can decide the existence of a winning strategy for the game. For guarded disjunctive TGDs, we can obtain Datalog rules with disjunction in the heads. However, the use of disjunction is limited, and the resulting rules fall into a fragment that can be evaluated in deterministic single exponential time. We proceed quite differently for the case when the TGDs are not disjunctive and we show that we can obtain a plain Datalog query. Notably, unlike previous translations for related fragments, our translation requires only polynomial time if the maximal number of variables in the (disjunctive) TGDs is bounded by a constant.

BibTeX - Entry

@InProceedings{ahmetaj_et_al:LIPIcs:2018:8595,
  author =	{Shqiponja Ahmetaj and Magdalena Ortiz and Mantas Simkus},
  title =	{{Rewriting Guarded Existential Rules into Small Datalog Programs}},
  booktitle =	{21st International Conference on Database Theory (ICDT 2018)},
  pages =	{4:1--4:24},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-063-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{98},
  editor =	{Benny Kimelfeld and Yael Amsterdamer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8595},
  URN =		{urn:nbn:de:0030-drops-85950},
  doi =		{10.4230/LIPIcs.ICDT.2018.4},
  annote =	{Keywords: Existential rules, Expressiveness, Descriptive Complexity, Query Rewriting}
}

Keywords: Existential rules, Expressiveness, Descriptive Complexity, Query Rewriting
Seminar: 21st International Conference on Database Theory (ICDT 2018)
Issue Date: 2018
Date of publication: 28.02.2018


DROPS-Home | Fulltext Search | Imprint Published by LZI