Parallel-correctness and containment for conjunctive queries with union and negation

DOI10.1145/3329120MaRDI QIDQ4972156zbMATH OpenOpenAlexFDO

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

Publication date 22 November 2019

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/5778/

zbMATH Keywords

conjunctive queriescontainmentparallel-correctness

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
• Parallel-correctness and transferability for conjunctive queries under bag semantics
• Parallel-correctness and transferability for conjunctive queries
• scientific article; zbMATH DE number 1951561
• On the containment problem for queries in conjunctive form with negation

Cited in

(7)

• Distribution policies for Datalog
• Parallel-correctness and transferability for conjunctive queries under bag semantics
• Parallel-correctness and transferability for conjunctive queries
• Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
• Logic Programming
• Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model
• Locality-aware distribution schemes

This page was built for publication: Parallel-correctness and containment for conjunctive queries with union and negation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972156)