Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation-Reference-Cited by-同舟云学术

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

Published:2019-07-31 Issue:3 Volume:20 Page:1-24
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Geck Gaetano¹^ORCID,Ketsman Bas²^ORCID,Neven Frank³^ORCID,Schwentick Thomas¹^ORCID

Affiliation:

1. TU Dortmund University, Dortmund, Germany

2. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

3. Hasselt University 8 transnational University of Limburg

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 article 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.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3329120

Reference22 articles.

1. Apache Software Foundation. 2010. Spark. Retrieved from: http://spark.apache.org. Apache Software Foundation. 2010. Spark. Retrieved from: http://spark.apache.org.

2. On Datalog vs Polynomial Time

3. Parallel skyline queries

4. Parallel-Correctness and Transferability for Conjunctive Queries

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing Distributed Protocols with Query Rewrites;Proceedings of the ACM on Management of Data;2024-03-12

2. Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity;Journal of the ACM;2021-10-31

3. Distribution Policies for Datalog;Theory of Computing Systems;2019-12-04