Loading...
Please wait, while we are loading the content...
Similar Documents
Worst-Case Optimal Algorithms for Parallel Query Processing
| Content Provider | Paperity |
|---|---|
| Author | Beame, Paul Suciu, Dan Koutris, Paraschos |
| Abstract | In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with p servers. In contrast to previous work, where upper and lower bounds on the communication were specified for particular structures of data (either data without skew, or data with specific types of skew), in this work we focus on worst-case analysis of the communication cost. The goal is to find worst-case optimal parallel algorithms, similar to the work of (Ngo et al. 2012) for sequential algorithms. |
| Starting Page | 8:1 |
| Ending Page | 8:18 |
| File Format | HTM / HTML |
| DOI | 10.4230/LIPIcs.ICDT.2016.8 |
| Journal | Leibniz International Proceedings in Informatics |
| Volume Number | 48 |
| Language | English |
| Publisher | Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik |
| Publisher Date | 2016-02-29 |
| Access Restriction | Open |
| Subject Keyword | Conjunctive query Parallel computation Worst-case bounds |
| Content Type | Text |
| Resource Type | Article |
