Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/21060
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGECK, Gaetano-
dc.contributor.authorKETSMAN, Bas-
dc.contributor.authorNEVEN, Frank-
dc.contributor.authorSchwentick, Thomas-
dc.date.accessioned2016-05-10T07:30:07Z-
dc.date.available2016-05-10T07:30:07Z-
dc.date.issued2016-
dc.identifier.citationMartens, Wim; Zeume, Thomas (Ed.). LIPIcs–Leibniz International Proceedings in Informatics-
dc.identifier.isbn978-3-95977-002-6-
dc.identifier.urihttp://hdl.handle.net/1942/21060-
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 and without negation. As a by-product it is shown that the containment problem for conjunctive queries with negation is coNEXPTIME-complete.-
dc.language.isoen-
dc.publisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik-
dc.relation.ispartofseriesLIPIcs-
dc.rights© Gaetano Geck, Bas Ketsman, Frank Neven, and Thomas Schwentick; licensed under Creative Commons License CC-BY-
dc.subject.otherconjunctive queries; distributed evaluation-
dc.titleParallel-Correctness and Containment for Conjunctive Queries with Union and Negation-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsMartens, Wim-
local.bibliographicCitation.authorsZeume, Thomas-
local.bibliographicCitation.conferencedateMarch 15-18, 2016-
local.bibliographicCitation.conferencename19th International Conference on Database Theory (ICDT 2016)-
local.bibliographicCitation.conferenceplaceBordeaux, France-
local.format.pages17-
local.bibliographicCitation.jcatC1-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr48-
dc.identifier.doi10.4230/LIPIcs.ICDT.2016.9-
dc.identifier.urlhttp://drops.dagstuhl.de/opus/frontdoor.php?source_opus=5778-
local.bibliographicCitation.btitleLIPIcs–Leibniz International Proceedings in Informatics-
item.fulltextWith Fulltext-
item.accessRightsOpen Access-
item.contributorGECK, Gaetano-
item.contributorKETSMAN, Bas-
item.contributorNEVEN, Frank-
item.contributorSchwentick, Thomas-
item.fullcitationGECK, Gaetano; KETSMAN, Bas; NEVEN, Frank & Schwentick, Thomas (2016) Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. In: Martens, Wim; Zeume, Thomas (Ed.). LIPIcs–Leibniz International Proceedings in Informatics.-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
8.pdfPublished version580.86 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

6
checked on Sep 3, 2020

Page view(s)

68
checked on Sep 7, 2022

Download(s)

112
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


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