Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/23351
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | AMELOOT, Tom | - |
dc.contributor.author | GECK, Gaetano | - |
dc.contributor.author | KETSMAN, Bas | - |
dc.contributor.author | NEVEN, Frank | - |
dc.contributor.author | Schwentick, Thomas | - |
dc.date.accessioned | 2017-03-15T08:15:44Z | - |
dc.date.available | 2017-03-15T08:15:44Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | Communications of the ACM, 60(3), p. 93-100 | - |
dc.identifier.issn | 0001-0782 | - |
dc.identifier.uri | http://hdl.handle.net/1942/23351 | - |
dc.description.abstract | Evaluating queries over massive amounts of data is a major challenge in the big data era. Modern massively parallel systems, like e.g. Spark, organize query answering as a sequence of rounds each consisting of a distinct communication phase followed by a computation phase. The communication phase redistributes data over the available servers, while in the subsequent computation phase each server performs the actual computation on its local data. There is a growing interest in single-round algorithms for evaluating multiway joins where data is first reshuffled over the servers and then evaluated in a parallel but communication-free way. As the amount of communication induced by a reshuffling of the data is a dominating cost in such systems, we introduce a framework for reasoning about data partitioning to detect when we can avoid the data reshuffling step. Specifically, we formalize the decision problems parallel-correctness and transfer of parallel-correctness, provide semantical characterizations, and obtain tight complexity bounds. | - |
dc.language.iso | en | - |
dc.title | Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 100 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 93 | - |
dc.identifier.volume | 60 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Ameloot, TJ (reprint author), Hasselt Univ, Hasselt, Belgium. tom.ameloot@uhasselt.be; gaetano.geck@udo.edu; bas.ketsman@uhasselt.be; frank.neven@uhasselt.be; thomas.schwentick@udo.edu | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1145/3041063 | - |
dc.identifier.isi | 000396058600024 | - |
item.accessRights | Open Access | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2018 | - |
item.contributor | AMELOOT, Tom | - |
item.contributor | GECK, Gaetano | - |
item.contributor | KETSMAN, Bas | - |
item.contributor | NEVEN, Frank | - |
item.contributor | Schwentick, Thomas | - |
item.fullcitation | AMELOOT, Tom; GECK, Gaetano; KETSMAN, Bas; NEVEN, Frank & Schwentick, Thomas (2017) Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems. In: Communications of the ACM, 60(3), p. 93-100. | - |
crisitem.journal.issn | 0001-0782 | - |
crisitem.journal.eissn | 1557-7317 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
cacm.pdf | Peer-reviewed author version | 333.7 kB | Adobe PDF | View/Open |
p93-ameloot.pdf Restricted Access | Published version | 1.19 MB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
3
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
3
checked on Mar 29, 2024
Page view(s)
82
checked on Sep 5, 2022
Download(s)
204
checked on Sep 5, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.