Communication steps for parallel query processing

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2013, Pages 273-284

  Beame, Paul ^a   Koutris, Paraschos ^a   Suciu, Dan ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Lower Bounds; Parallel Computation

Indexed keywords

GLOBAL COMMUNICATION; LOWER AND UPPER BOUNDS; LOWER BOUNDS; PARALLEL COMPUTATION; PARALLEL QUERY PROCESSING; RELATIONAL QUERIES; ROUTING DECISIONS; TRANSITIVE CLOSURE;

ALGORITHMS;

COMMUNICATION;

EID: 84880569196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463664.2465224     Document Type: Conference Paper

References (26)

1. F. N. Afrati, A. D. Sarma, S. Salihoglu, and J. D. Ullman. Upper and lower bounds on the cost of a map-reduce computation. CoRR, abs/1206.4377, 2012.
2. F. N. Afrati and J. D. Ullman. Optimizing joins in a map-reduce environment. In EDBT, pages 99-110, 2010.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS, 58(1): 137-147, 1999.
4. A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. In FOCS, pages 739-748, 2008.
5. S. Chaudhuri. What next?: a half-dozen data management research goals for big data and the cloud. In PODS, pages 1-4, 2012.
6. F. R. K. Chung, Z. Füredi, M. R. Garey, and R. L. Graham. On the fractional covering number of hypergraphs. SIAM J. Discrete Math., 1(1): 45-49, 1988.
7. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
8. EMC Corporation. Data science revealed: A data-driven glimpse into the burgeoning new field. http://www.emc.com/collateral/about/news/emc-data-science- study-wp.pdf.
9. J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina. On distributing symmetric streaming computations. ACM Transactions on Algorithms, 6(4), 2010.
10. E. Friedgut. Hypergraphs, entropy, and inequalities. American Mathematical Monthly, pages 749-760, 2004.
11. A. Gál and P. Gopalan. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. In FOCS, pages 294-304, 2007.
12. S. Ganguly, A. Silberschatz, and S. Tsur. Parallel bottom-up processing of datalog queries. J. Log. Program., 14(1&2): 101-126, 1992.
13. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In SODA, pages 289-298, 2006.
14. S. Guha and Z. Huang. Revisiting the direct sum theorem and space lower bounds in random order streams. In ICALP, volume 5555 of LNCS, pages 513-524. Springer, 2009.
15. Hadoop. http://hadoop.apache.org/.
16. H. J. Karloff, S. Suri, and S. Vassilvitskii. A model of computation for mapreduce. In SODA, pages 938-948, 2010.
17. P. Koutris and D. Suciu. Parallel evaluation of conjunctive queries. In PODS, pages 223-234, 2011.
18. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, England; New York, 1997.
19. S. Melnik, A. Gubarev, J. J. Long, G. Romer, S. Shivakumar, M. Tolton, and T. Vassilakis. Dremel: Interactive analysis of web-scale datasets. PVLDB, 3(1): 330-339, 2010.
20. H. Q. Ngo, E. Porat, C. Ré, and A. Rudra. Worst-case optimal join algorithms: [extended abstract]. In PODS, pages 37-48, 2012.
21. C. Olston, B. Reed, U. Srivastava, R. Kumar, and A. Tomkins. Pig latin: a not-so-foreign language for data processing. In SIGMOD Conference, pages 1099-1110, 2008.
22. S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In WWW, pages 607-614, 2011.
23. A. Thusoo, J. S. Sarma, N. Jain, Z. Shao, P. Chakka, S. Anthony, H. Liu, P. Wyckoff, and R. Murthy. Hive - a warehousing solution over a map-reduce framework. PVLDB, 2(2): 1626-1629, 2009.
24. P. Tiwari. Lower bounds on communication complexity in distributed computer networks. JACM, 34(4): 921-938, Oct. 1987.
25. J. D. Ullman. Designing good mapreduce algorithms. ACM Crossroads, 19(1): 30-34, 2012.
26. A. C. Yao. Lower bounds by probabilistic arguments. In FOCS, pages 420-428, Tucson, AZ, 1983.