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


Berkholz, Christoph ; Keppeler, Jens ; Schweikardt, Nicole

Answering UCQs under Updates and in the Presence of Integrity Constraints

pdf-format:
LIPIcs-ICDT-2018-8.pdf (0.6 MB)


Abstract

We investigate the query evaluation problem for fixed queries over fully dynamic databases where tuples can be inserted or deleted. The task is to design a dynamic data structure that can immediately report the new result of a fixed query after every database update. We consider unions of conjunctive queries (UCQs) and focus on the query evaluation tasks testing (decide whether an input tuple belongs to the query result), enumeration (enumerate, without repetition, all tuples in the query result), and counting (output the number of tuples in the query result). We identify three increasingly restrictive classes of UCQs which we call t-hierarchical, q-hierarchical, and exhaustively q-hierarchical UCQs. Our main results provide the following dichotomies: If the query's homomorphic core is t-hierarchical (q-hierarchical, exhaustively q-hierarchical), then the testing (enumeration, counting) problem can be solved with constant update time and constant testing time (delay, counting time). Otherwise, it cannot be solved with sublinear update time and sublinear testing time (delay, counting time), unless the OV-conjecture and/or the OMv-conjecture fails. We also study the complexity of query evaluation in the dynamic setting in the presence of integrity constraints, and we obtain similar dichotomy results for the special case of small domain constraints (i.e., constraints which state that all values in a particular column of a relation belong to a fixed domain of constant size).

BibTeX - Entry

@InProceedings{berkholz_et_al:LIPIcs:2018:8599,
  author =	{Christoph Berkholz and Jens Keppeler and Nicole Schweikardt},
  title =	{{Answering UCQs under Updates and in the Presence of Integrity Constraints}},
  booktitle =	{21st International Conference on Database Theory (ICDT 2018)},
  pages =	{8:1--8:19},
  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/8599},
  URN =		{urn:nbn:de:0030-drops-85990},
  doi =		{10.4230/LIPIcs.ICDT.2018.8},
  annote =	{Keywords: dynamic query evaluation, union of conjunctive queries, constant-delay enumeration, counting problem, testing}
}

Keywords: dynamic query evaluation, union of conjunctive queries, constant-delay enumeration, counting problem, testing
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