Author image not provided
 Gaetano Geck

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.75
Citation Count7
Publication count4
Publication years2015-2017
Available for download4
Average downloads per article202.75
Downloads (cumulative)811
Downloads (12 Months)538
Downloads (6 Weeks)37
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


4 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 4 of 4
Sort by:

1 published by ACM
September 2017 Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 18,   Downloads (12 Months): 80,   Downloads (Overall): 80

Full text available: PDFPDF
A 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 ...
Keywords: Distributed databases, one-round evaluation, parallel query evaluation, distribution policies

2 published by ACM
February 2017 Communications of the ACM: Volume 60 Issue 3, March 2017
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 14,   Downloads (12 Months): 337,   Downloads (Overall): 337

Full text available: HtmlHtml  PDFPDF
Evaluating queries over massive amounts of data is a major challenge in the big data era. Modern massively parallel systems, such as, 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 ...

3 published by ACM
June 2016 ACM SIGMOD Record: Volume 45 Issue 1, March 2016
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 3,   Downloads (12 Months): 50,   Downloads (Overall): 107

Full text available: PDFPDF
A 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 is first reshuffled over many servers and then evaluated in a parallel but communication- free way. The reshuffling ...

4 published by ACM
May 2015 PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2,   Downloads (12 Months): 71,   Downloads (Overall): 287

Full text available: PDFPDF
A 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 is first reshuffled over many servers and then evaluated in a parallel but communication-free way. The reshuffling itself ...
Keywords: one-round evaluation, parallel query evaluation, distributed databases, distribution policies



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us