License:
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2016.9
URN: urn:nbn:de:0030-drops-57787
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5778/
Geck, Gaetano ;
Ketsman, Bas ;
Neven, Frank ;
Schwentick, Thomas
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
Abstract
Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the reshuffle is adequate for computing a given query, also referred to as parallel-correctness. This paper extends the study of the complexity of parallel-correctness and its constituents, parallel-soundness and parallel-completeness, to unions of conjunctive queries with and without negation. As a by-product it is shown that the containment problem for conjunctive queries with negation is coNEXPTIME-complete.
BibTeX - Entry
@InProceedings{geck_et_al:LIPIcs:2016:5778,
author = {Gaetano Geck and Bas Ketsman and Frank Neven and Thomas Schwentick},
title = {{Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Wim Martens and Thomas Zeume},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5778},
URN = {urn:nbn:de:0030-drops-57787},
doi = {10.4230/LIPIcs.ICDT.2016.9},
annote = {Keywords: Conjunctive queries, distributed evaluation}
}
Keywords: |
|
Conjunctive queries, distributed evaluation |
Collection: |
|
19th International Conference on Database Theory (ICDT 2016) |
Issue Date: |
|
2016 |
Date of publication: |
|
14.03.2016 |