Skew in parallel query processing

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

Volumn , Issue , 2014, Pages 212-223

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

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Lower bounds; Parallel computation; Skew

Indexed keywords

COMMUNICATION; QUERY LANGUAGES;

COMPUTATIONAL POWER; CONJUNCTIVE QUERIES; LOWER BOUNDS; PARALLEL COMPUTATION; PARALLEL QUERY PROCESSING; POLY-LOGARITHMIC FACTORS; SKEW; UPPER AND LOWER BOUNDS;

QUERY PROCESSING;

EID: 84904296244     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2594538.2594558     Document Type: Conference Paper

References (17)

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. PVLDB, 6(4):277-288, 2013.
2. F. N. Afrati and J. D. Ullman. Optimizing joins in a map-reduce environment. In EDBT, pages 99-110, 2010.
3. A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. In FOCS, pages 739-748, 2008.
4. P. Beame, P. Koutris, and D. Suciu. Communication steps for parallel query processing. In PODS, pages 273-284, 2013.
5. P. Beame, P. Koutris, and D. Suciu. Skew in parallel query processing. CoRR, abs/1401.1872, 2014.
6. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
7. E. Friedgut. Hypergraphs, entropy, and inequalities. American Mathematical Monthly, pages 749-760, 2004.
8. S. Ganguly, A. Silberschatz, and S. Tsur. Parallel bottom-up processing of datalog queries. J. Log. Program., 14(1&2):101-126, 1992.
9. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In SODA, pages 289-298, 2006.
10. H. Q. Ngo, E. Porat, C. Ré, and A. Rudra. Worst-case optimal join algorithms: [extended abstract]. In PODS, pages 37-48, 2012.
11. 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.
12. S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In WWW, pages 607-614, 2011.
13. C. B. Walton, A. G. Dale, and R. M. Jenevein. A taxonomy and performance model of data skew effects in parallel joins. In VLDB, pages 537-548, 1991.
14. R. S. Xin, J. Rosen, M. Zaharia, M. J. Franklin, S. Shenker, and I. Stoica. Shark: Sql and rich analytics at scale. In SIGMOD Conference, pages 13-24, 2013.
15. Y. Xu, P. Kostamaa, X. Zhou, and L. Chen. Handling data skew in parallel joins in shared-nothing systems. In SIGMOD Conference, pages 1043-1052, 2008.
16. A. C. Yao. Lower bounds by probabilistic arguments. In FOCS, pages 420-428, Tucson, AZ, 1983.
17. M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In NSDI, 2012.