Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21060
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GECK, Gaetano | - |
dc.contributor.author | KETSMAN, Bas | - |
dc.contributor.author | NEVEN, Frank | - |
dc.contributor.author | Schwentick, Thomas | - |
dc.date.accessioned | 2016-05-10T07:30:07Z | - |
dc.date.available | 2016-05-10T07:30:07Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Martens, Wim; Zeume, Thomas (Ed.). LIPIcs–Leibniz International Proceedings in Informatics | - |
dc.identifier.isbn | 978-3-95977-002-6 | - |
dc.identifier.uri | http://hdl.handle.net/1942/21060 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik | - |
dc.relation.ispartofseries | LIPIcs | - |
dc.rights | © Gaetano Geck, Bas Ketsman, Frank Neven, and Thomas Schwentick; licensed under Creative Commons License CC-BY | - |
dc.subject.other | conjunctive queries; distributed evaluation | - |
dc.title | Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Martens, Wim | - |
local.bibliographicCitation.authors | Zeume, Thomas | - |
local.bibliographicCitation.conferencedate | March 15-18, 2016 | - |
local.bibliographicCitation.conferencename | 19th International Conference on Database Theory (ICDT 2016) | - |
local.bibliographicCitation.conferenceplace | Bordeaux, France | - |
local.format.pages | 17 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 48 | - |
dc.identifier.doi | 10.4230/LIPIcs.ICDT.2016.9 | - |
dc.identifier.url | http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=5778 | - |
local.bibliographicCitation.btitle | LIPIcs–Leibniz International Proceedings in Informatics | - |
item.fulltext | With Fulltext | - |
item.accessRights | Open Access | - |
item.contributor | GECK, Gaetano | - |
item.contributor | KETSMAN, Bas | - |
item.contributor | NEVEN, Frank | - |
item.contributor | Schwentick, Thomas | - |
item.fullcitation | GECK, 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 |
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.