Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/29779
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGaetano Geck-
dc.contributor.authorKETSMAN, Bas-
dc.contributor.authorNEVEN, Frank-
dc.contributor.authorThomas Schwentick-
dc.date.accessioned2019-10-17T13:33:01Z-
dc.date.available2019-10-17T13:33:01Z-
dc.date.issued2019-
dc.identifier.citationACM Transactions on Computational Logic, 20(3), p. 1-24 (Art N° 18)-
dc.identifier.issn1529-3785-
dc.identifier.urihttp://hdl.handle.net/1942/29779-
dc.description.abstractSingle-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.-
dc.language.isoen-
dc.rights2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.-
dc.subject.otherConjunctive queries; parallel-correctness; containment-
dc.titleParallel-Correctness and Containment for Conjunctive Queries with Union and Negation-
dc.typeJournal Contribution-
dc.identifier.epage24-
dc.identifier.issue3-
dc.identifier.spage1-
dc.identifier.volume20-
local.bibliographicCitation.jcatA1-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.bibliographicCitation.artnr18-
dc.identifier.doi10.1145/3329120-
dc.identifier.isi000475734700006-
item.fulltextWith Fulltext-
item.contributorGaetano Geck-
item.contributorKETSMAN, Bas-
item.contributorNEVEN, Frank-
item.contributorThomas Schwentick-
item.fullcitationGaetano Geck; KETSMAN, Bas; NEVEN, Frank & Thomas Schwentick (2019) Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. In: ACM Transactions on Computational Logic, 20(3), p. 1-24 (Art N° 18).-
item.accessRightsRestricted Access-
item.validationecoom 2020-
crisitem.journal.issn1529-3785-
crisitem.journal.eissn1557-945X-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
a18-geck (1).pdf
  Restricted Access		Published version363.02 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.