Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/25630
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAMELOOT, Tom-
dc.contributor.authorGECK, Gaetano-
dc.contributor.authorKETSMAN, Bas-
dc.contributor.authorNEVEN, Frank-
dc.contributor.authorSchwentick, Thomas-
dc.date.accessioned2018-03-05T09:43:42Z-
dc.date.available2018-03-05T09:43:42Z-
dc.date.issued2017-
dc.identifier.citationJOURNAL OF THE ACM, 64(5)-
dc.identifier.issn0004-5411-
dc.identifier.urihttp://hdl.handle.net/1942/25630-
dc.description.abstractA dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data are first reshuffled over many servers and then evaluated in a parallel but communication-free way. The reshuffling itself is specified as a distribution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We study the complexity of parallel-correctness for conjunctive queries as well as transferability of parallel-correctness between queries. We also investigate the complexity of transferability for certain families of distribution policies, including the Hypercube distribution policies.-
dc.language.isoen-
dc.rightsPermission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.-
dc.subject.otherDistributed databases; Parallel query evaluation; One-round evaluation; Distribution policies-
dc.titleParallel-Correctness and Transferability for Conjunctive Queries-
dc.typeJournal Contribution-
dc.identifier.issue5-
dc.identifier.volume64-
local.bibliographicCitation.jcatA1-
dc.description.notesAmeloot, TJ (reprint author), Hasselt Univ, Martelarenlaan 42, B-3500 Hasselt, Belgium. tom.ameloot@uhasselt.be; gaetano.geck@tu-dortmund.de; bas.ketsman@uhasselt.be; frank.neven@uhasselt.be; thomas.schwentick@tu-dortmund.de-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.bibliographicCitation.artnr36-
dc.identifier.doi10.1145/3106412-
dc.identifier.isi000443590400008-
item.contributorAMELOOT, Tom-
item.contributorGECK, Gaetano-
item.contributorKETSMAN, Bas-
item.contributorNEVEN, Frank-
item.contributorSchwentick, Thomas-
item.fullcitationAMELOOT, Tom; GECK, Gaetano; KETSMAN, Bas; NEVEN, Frank & Schwentick, Thomas (2017) Parallel-Correctness and Transferability for Conjunctive Queries. In: JOURNAL OF THE ACM, 64(5).-
item.accessRightsRestricted Access-
item.fulltextWith Fulltext-
crisitem.journal.issn0004-5411-
crisitem.journal.eissn1557-735X-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
jacm2016-final.pdf
  Restricted Access		Peer-reviewed author version502.45 kBAdobe PDFView/Open    Request a copy
a36-ameloot.pdf
  Restricted Access		Published version725.81 kBAdobe PDFView/Open    Request a copy
Show simple item record

SCOPUSTM   
Citations

7
checked on Sep 3, 2020

WEB OF SCIENCETM
Citations

5
checked on Apr 22, 2024

Page view(s)

108
checked on Sep 7, 2022

Download(s)

126
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


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