< Terug naar vorige pagina

Publicatie

Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation

Tijdschriftbijdrage - Tijdschriftartikel

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 negation. As a by-product it is shown that the containment problem for conjunctive queries with negation is coNEXPTIME-complete.
Tijdschrift: ACM Transactions on Computational Logic
ISSN: 1529-3785
Issue: 3
Volume: 20
Pagina's: 1 - 24
Jaar van publicatie:2019
Trefwoorden:Conjunctive queries, parallel-correctness, containment
BOF-keylabel:ja
IOF-keylabel:ja
BOF-publication weight:0.1
CSS-citation score:1
Auteurs:International
Authors from:Higher Education
Toegankelijkheid:Closed