Work

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

Year: 2015

Type: article

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.

Source: DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI: 10.48550/arxiv.1512.06246

Authors: Geck, Gaetano, Ketsman, Bas, Neven, Frank, Schwentick, Thomas

Institutions: TU Dortmund University, École Polytechnique Fédérale de Lausanne, Hasselt University, Transnational University Limburg

Language: English

Topic: Advanced Database Systems and Queries

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2950064944

FWCI:

Cites: 11

Cited by: 2

Related to: 20