Size bounds and query plans for relational joins

SIAM Journal on Computing

Volumn 42, Issue 4, 2013, Pages 1737-1767

  Atserias, Albert ^a   Grohe, Martin ^b   Marx, Daniel ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

Database query; Fractional edge cover; Join; Linear programming; Query plan

Indexed keywords

AVERAGE-CASE MODELS; COMBINATORIAL PARAMETERS; DATABASE QUERIES; DATABASE QUERY LANGUAGE; EDGE COVER; QUERY PLAN; RELATIONAL ALGEBRA; WORST-CASE MODELS;

JOINING; LINEAR PROGRAMMING; PROBABILITY DISTRIBUTIONS; PROJECT MANAGEMENT; QUERY LANGUAGES;

QUERY PROCESSING;

EID: 84884941634     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110859440     Document Type: Conference Paper

References (16)

1. S. ABITEBOUL, R. HULL, and V. VIANU, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. N. ALON and J. SPENCER, The Probabilistic Method, 2nd ed., John Wiley, New York, 1992.
3. S. CHAUDHURI, An overview of query optimization in relational systems, in Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 1998, pp. 34-43.
4. 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 (1986), pp. 23-37.
5. J. FLUM, M. FRICK, and M. GROHE, Query evaluation via tree-decompositions, J. ACM, 49 (2002), pp. 716-752.
6. E. FRIEDGUT and J. KAHN, On the number of copies of a hypergraph in another, Israel J. Math., 105 (1998), pp. 251-256.
7. H. GARCIA-MOLINA, J. WIDOM, and J. D. ULLMAN, Database System Implementation, Prentice-Hall, Englewood Cliffs, NJ, 1999.
8. G. GOTTLOB, S. T. LEE, G. VALIANT, and P. VALIANT, Size and treewidth bounds for conjunctive queries, J. ACM, 59 (2012), pp. 1-35.
9. G. GRAEFE, Query evaluation techniques for large databases, ACM Computing Surveys, 25 (1993), pp. 73-169.
10. M. GROHE and D. MARX, Constraint solving via fractional edge covers, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 289-298. (Pubitemid 43275250)
11. 1-ε, Acta Math., 182 (1999), pp. 105-142.
12. J. H. KIM and V. H. VU, Concentration of multivariate polynomials and its applications, Combinatorica, 20 (2000), pp. 417-434.
13. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
14. J. RHADAKRISHNAN, Entropy and Counting, http://www.tcs.tifr.res.in/ ~jaikumar/mypage.html.
15. G. VALIANT and P. VALIANT, Size bounds for conjunctive queries with general functional dependencies, arXiv:0909.2030v2, 2010.
16. V. V. VAZIRANI, Approximation Algorithms, Springer-Verlag, New York, 2001.