Worst-case optimal join algorithms

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

Volumn , Issue , 2012, Pages 37-48

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

^a UNIVERSITY AT BUFFALO   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

bollob s thomason inequality; fractional cover bound; join algorithms; loomis whitney inequality

Indexed keywords

CONJUNCTIVE QUERIES; CONSTRUCTIVE PROOF; DATA COMPLEXITY; DATABASE RESEARCH; ENTROPY INEQUALITY; FRACTIONAL COVER; GEOMETRIC INEQUALITIES; JOIN ALGORITHM; JOIN PROCESSING; LOOMIS-WHITNEY INEQUALITY; NOVEL ALGORITHM; OPTIMAL BOUNDS; RUNNING TIME;

INFORMATION THEORY; OPTIMIZATION; QUERY LANGUAGES; QUERY PROCESSING;

ALGORITHMS;

EID: 84862629195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213556.2213565     Document Type: Conference Paper

References (39)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. N. Alon, P. B. Gibbons, Y. Matias, and M. Szegedy. Tracking join and self-join sizes in limited storage. In PODS, pages 10-20, 1999.
3. N. Alon, I. Newman, A. Shen, G. Tardos, and N. K. Vereshchagin. Partitioning multi-dimensional sets in a small number of "uniform" parts. Eur. J. Comb., 28(1):134-144, 2007. (Pubitemid 44458157)
4. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997. (Pubitemid 127440916)
5. A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. In FOCS, pages 739-748. IEEE, 2008.
6. R. Avnur and J. M. Hellerstein. Eddies: Continuously adaptive query processing. In SIGMOD Conference, pages 261-272, 2000.
7. S. Babu, P. Bizarro, and D. J. DeWitt. Proactive re-optimization. In SIGMOD Conference, pages 107-118, 2005.
8. B. Bollobás and A. Thomason. Projections of bodies and hereditary properties of hypergraphs. Bull. London Math. Soc., 27(5), 1995.
9. F. R. K. Chung, R. L. Graham, P. Frankl, and J. B. Shearer. Some intersection theorems for ordered sets and graphs. J. Combin. Theory Ser. A, 43(1):23-37, 1986.
10. A. Deligiannakis, M. N. Garofalakis, and N. Roussopoulos. Extended wavelets for multiple measures. TODS, 32(2):10, 2007.
11. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. J. ACM, 49(6):716-752, 2002.
12. 2 for each compressed sensing with tiny failure probability, November 2011. Manuscript.
13. G. Gottlob, S. T. Lee, and G. Valiant. Size and treewidth bounds for conjunctive queries. In PODS, pages 45-54, 2009.
14. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions: A survey. In MFCS, 2001.
15. G. Gottlob, Z. Miklós, and T. Schwentick. Generalized hypertree decompositions: np-hardness and tractable variants. In PODS, 2007.
16. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-170, June 1993. (Pubitemid 23712749)
17. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In SODA, pages 289-298, 2006.
18. K. Gyarmati, M. Matolcsi, and I. Z. Ruzsa. A superadditivity and submultiplicativity property for cardinalities of sumsets. Combinatorica, 30(2):163-174, 2010.
19. T. S. Han. Nonnegative entropy measures of multivariate symmetric correlations. Information and Control, 36(2):133-156, 1978.
20. Y. E. Ioannidis. The history of histograms (abridged). In VLDB, 2003.
21. Y. E. Ioannidis and S. Christodoulakis. On the propagation of errors in the size of join results. In SIGMOD Conference, 1991.
22. D. Irony, S. Toledo, and A. Tiskin. Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput., 64(9):1017-1026, 2004. (Pubitemid 40000755)
23. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal Histograms with Quality Guarantees. In VLDB, 1998.
24. A. C. König and G. Weikum. Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation. In VLDB, 1999.
25. A. R. Lehman and E. Lehman. Network coding: does the model need tuning? In SODA, pages 499-504, 2005.
26. L. H. Loomis and H. Whitney. An inequality related to the isoperimetric inequality. Bull. Amer. Math. Soc, 55:961-962, 1949.
27. R. Lyons. Probability on trees and networks, jun 2011. with Yuval Peres url: http://php.indiana.edu/ rdlyons/prbtree/prbtree.html.
28. V. Markl, N. Megiddo, M. Kutsch, T. M. Tran, P. J. Haas, and U. Srivastava. Consistently estimating the selectivity of conjuncts of predicates. In VLDB, pages 373-384, 2005.
29. D. Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In STOC, pages 735-744, 2010.
30. H. Q. Ngo, E. Porat, C. Ré, and A. Rudra. Worst-case optimal join algorithms, 2012. arXiv:1203.1952 [cs.DB].
31. H. Q. Ngo, E. Porat, and A. Rudra. Personal Communciation.
32. A. Pagh and R. Pagh. Scalable computation of acyclic joins. In PODS, pages 225-232, 2006.
33. V. Poosala, Y. Ioannidis, P. Haas, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In SIGMOD, pages 294-305, 1996.
34. A. Schrijver. Combinatorial optimization. Polyhedra and efficiency. Vol. A, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003.
35. U. Srivastava, P. J. Haas, V. Markl,M. Kutsch, and T. M. Tran. Isomer: Consistent histogram construction using query feedback. In ICDE, page 39, 2006. (Pubitemid 44539831)
36. K. Tzoumas, A. Deshpande, and C. S. Jensen. Lightweight graphical models for selectivity estimation without independence assumptions. PVLDB, 4(11):852-863, 2011.
37. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theor. Comput. Sci., 47(3):85-93, 1986.
38. D. E. Willard. Applications of range query theory to relational data base join and selection operations. J. Comput. Syst. Sci., 52(1), 1996.
39. Y. Xu, P. Kostamaa, X. Zhou, and L. Chen. Handling data skew in parallel joins in shared-nothing systems. In SIGMOD, 2008.