Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/29779
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gaetano Geck | - |
dc.contributor.author | KETSMAN, Bas | - |
dc.contributor.author | NEVEN, Frank | - |
dc.contributor.author | Thomas Schwentick | - |
dc.date.accessioned | 2019-10-17T13:33:01Z | - |
dc.date.available | 2019-10-17T13:33:01Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | ACM Transactions on Computational Logic, 20(3), p. 1-24 (Art N° 18) | - |
dc.identifier.issn | 1529-3785 | - |
dc.identifier.uri | http://hdl.handle.net/1942/29779 | - |
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 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.rights | 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. | - |
dc.subject.other | Conjunctive queries; parallel-correctness; containment | - |
dc.title | Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 24 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 1 | - |
dc.identifier.volume | 20 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.bibliographicCitation.artnr | 18 | - |
dc.identifier.doi | 10.1145/3329120 | - |
dc.identifier.isi | 000475734700006 | - |
item.fullcitation | Gaetano 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.accessRights | Restricted Access | - |
item.contributor | Gaetano Geck | - |
item.contributor | KETSMAN, Bas | - |
item.contributor | NEVEN, Frank | - |
item.contributor | Thomas Schwentick | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2020 | - |
crisitem.journal.issn | 1529-3785 | - |
crisitem.journal.eissn | 1557-945X | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a18-geck (1).pdf Restricted Access | Published version | 363.02 kB | Adobe PDF | View/Open Request a copy |
WEB OF SCIENCETM
Citations
2
checked on Apr 16, 2024
Page view(s)
120
checked on Sep 7, 2022
Download(s)
96
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.