Skew strikes back: New developments in the theory of join algorithms

SIGMOD Record

Volumn 42, Issue 4, 2013, Pages 5-16

  Ngo, Hung Q ^a   Ré, Christopher ^b   Rudra, Atri ^a  

^a UNIVERSITY AT BUFFALO   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT SIZES; DATA BASE THEORY; DATA COMPLEXITY; EVALUATION PROBLEMS; INPUT DATAS; JOIN ALGORITHM; NON-TRIVIAL; OPTIMALITY;

OPTIMIZATION; QUERY PROCESSING;

ALGORITHMS;

EID: 84897749485     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/2590989.2590991     Document Type: Conference Paper

References (43)

1. Aho, A. V., Beeri, C., and Ullman, J. D. The theory of joins in relational databases. ACM Trans. Database Syst. 4, 3 (1979), 297-314.
2. Atserias, A., Grohe, M., and Marx, D. Size bounds and query plans for relational joins. SIAM J. Comput. 42, 4 (2013), 1737-1767.
3. Beeri, C., and Vardi, M. Y. A proof procedure for data dependencies. J. ACM 31, 4 (1984), 718-741.
4. Blanas, S., Li, Y., and Patel, J. M. Design and evaluation of main memory hash join algorithms for multi-core CPUs. In SIGMOD (2011), ACM, pp. 37-48.
5. Bollob́as, B., and Thomason, A. Projections of bodies and hereditary properties of hypergraphs. Bull. London Math. Soc. 27, 5 (1995), 417-424.
6. Chandra, A. K., and Merlin, P. M. Optimal implementation of conjunctive queries in relational data bases. In STOC (1977), J. E. Hopcroft, E. P. Friedman, and M. A. Harrison, Eds., ACM, pp. 77-90.
7. Chaudhuri, S. An overview of query optimization in relational systems. In PODS (1998), ACM, pp. 34-43.
8. Chekuri, C., and Rajaraman, A. Conjunctive query containment revisited. Theor. Comput. Sci. 239, 2 (2000), 211-229.
9. DeWitt, D. J., Naughton, J. F., Schneider, D. A., and Seshadri, S. Practical skew handling in parallel joins. In Proceedings of the 18th International Conference on Very Large Data Bases (San Francisco, CA, USA, 1992), VLDB '92, Morgan Kaufmann Publishers Inc., pp. 27-40.
10. Fagin, R. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 3 (1983), 514-550.
11. Friedgut, E., and Kahn, J. On the number of copies of one hypergraph in another. Israel J. Math. 105 (1998), 251-256.
12. Gottlob, G., Lee, S. T., and Valiant, G. Size and treewidth bounds for conjunctive queries. In PODS (2009), J. Paredaens and J. Su, Eds., ACM, pp. 45-54.
13. Gottlob, G., Lee, S. T., Valiant, G., and Valiant, P. Size and treewidth bounds for conjunctive queries. J. ACM 59, 3 (2012), 16.
14. Gottlob, G., Leone, N., and Scarcello, F. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64, 3 (2002), 579-627.
15. Gottlob, G., Leone, N., and Scarcello, F. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66, 4 (2003), 775-808.
16. Gottlob, G., Mikl'os, Z., and Schwentick, T. Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56, 6 (2009).
17. Graefe, G. Query evaluation techniques for large databases. ACM Computing Surveys 25, 2 (June 1993), 73-170.
18. Graham, M. H. On the universal relation, 1980. Tech. Report.
19. Grohe, M. Bounds and algorithms for joins via fractional edge covers. In In Search of Elegance in the Theory and Practice of Computation (2013), V. Tannen, L. Wong, L. Libkin, W. Fan, W.-C. Tan, and M. P. Fourman, Eds., vol. 8000 of Lecture Notes in Computer Science, Springer, pp. 321-338.
20. Grohe, M., and Marx, D. Constraint solving via fractional edge covers. In SODA (2006), ACM Press, pp. 289-298.
21. Gyssens, M., Jeavons, P., and Cohen, D. A. Decomposing constraint satisfaction problems using database techniques. Artif. Intell. 66, 1 (1994), 57-89.
22. Gyssens, M., and Paredaens, J. A decomposition methodology for cyclic databases. In Advances in Data Base Theory (1982), pp. 85-122.
23. Hardy, G. H., Littlewood, J. E., and Ṕolya, G. Inequalities. Cambridge University Press, Cambridge, 1988. Reprint of the 1952 edition.
24. Kim, C., Kaldewey, T., Lee, V. W., Sedlar, E., Nguyen, A. D., Satish, N., Chhugani, J., Di Blas, A., and Dubey, P. Sort vs. hash revisited: fast join implementation on modern multi-core CPUs. Proc. VLDB Endow. 2, 2 (Aug. 2009), 1378-1389.
25. Kolaitis, P. G., and Vardi, M. Y. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci. 61, 2 (2000), 302-332.
26. Loomis, L. H., and Whitney, H. An inequality related to the isoperimetric inequality. Bull. Amer. Math. Soc 55 (1949), 961-962.
27. Maier, D., Mendelzon, A. O., and Sagiv, Y. Testing implications of data dependencies. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 455-469.
28. Marx, D. Approximating fractional hypertree width. ACM Trans. Algorithms 6, 2 (Apr. 2010), 29:1-29:17.
29. Ngo, H. Q., Porat, E., R'e, C., and Rudra, A. Worst-case optimal join algorithms: [extended abstract]. In PODS (2012), pp. 37-48.
30. Ngo, H. Q., Re, C., and Rudra, A. Skew Strikes Back: New Developments in the Theory of Join Algorithms. ArXiv e-prints (Oct. 2013).
31. Papadimitriou, C. H., and Yannakakis, M. On the complexity of database queries. In PODS (1997), A. O. Mendelzon and Z. M. Özsoyoglu, Eds., ACM Press, pp. 12-19.
32. Ramakrishnan, R., and Gehrke, J. Database Management Systems, 3 ed. McGraw-Hill, Inc., New York, NY, USA, 2003.
33. Robertson, N., and Seymour, P. D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7, 3 (1986), 309-322.
34. Scarcello, F. Query answering exploiting structural properties. SIGMOD Record 34, 3 (2005), 91-99.
35. Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., and Price, T. G. Access path selection in a relational database management system. In Proceedings of the 1979 ACM SIGMOD international conference on Management of data (New York, NY, USA, 1979), SIGMOD '79, ACM, pp. 23-34.
36. Suri, S., and Vassilvitskii, S. Counting triangles and the curse of the last reducer. In WWW (2011), pp. 607-614.
37. Tsourakakis, C. E. Fast counting of triangles in large real networks without counting: Algorithms and laws. In ICDM (2008), IEEE Computer Society, pp. 608-617.
38. Vardi, M. Y. The complexity of relational query languages (extended abstract). In STOC (1982), H. R. Lewis, B. B. Simons, W. A. Burkhard, and L. H. Landweber, Eds., ACM, pp. 137-146.
39. Veldhuizen, T. L. Leapfrog Triejoin: a worst-case optimal join algorithm. In ICDT (2014). To appear.
40. Walton, C. B., Dale, A. G., and Jenevein, R. M. A taxonomy and performance model of data skew eects in parallel joins. In Proceedings of the 17th International Conference on Very Large Data Bases (San Francisco, CA, USA, 1991), VLDB '91, Morgan Kaufmann Publishers Inc., pp. 537-548.
41. Xu, Y., Kostamaa, P., Zhou, X., and Chen, L. Handling data skew in parallel joins in shared-nothing systems. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data (New York, NY, USA, 2008), SIGMOD '08, ACM, pp. 1043-1052.
42. Yannakakis, M. Algorithms for acyclic database schemes. In VLDB (1981), IEEE Computer Society, pp. 82-94.
43. Yu, C., and Ozsoyoglu, M. On determining tree-query membership of a distributed query. Informatica 22, 3 (1984), 261-282.