Size bounds and query plans for relational joins

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 739-748

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b HUMBOLDT UNIVERSITY   (Germany)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; PROBABILITY DISTRIBUTIONS; QUERY LANGUAGES;

AVERAGECASE MODELS; COMBINATORIAL PARAMETERS; CONSTANT FACTORS; DATABASE QUERIES; EDGE COVERS; EXECUTION PLANS; HYPER GRAPHS; LOWER BOUNDS; MAXIMUM DENSITIES; PROJECT PLANS; RELATIONAL ALGEBRAS; STANDARD DATABASES; UPPER BOUNDS;

DATABASE SYSTEMS;

EID: 57949090103     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.43     Document Type: Conference Paper

References (14)

1. S. Abiteboul, R. Hull, and V Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. N. Alon and J. Spencer. The Probabilistic Method. John Wiley, second edition, 1992.
3. A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. Available from the author's webpages, 2008.
4. S. Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 34-43, 1998.
5. 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.
6. J. Flum, M. Frick, and M. Grohe. Query evaluation via treedecompositions. Journal of the ACM, 49(6):716-752, 2002.
7. E. Friedgut and J. Kahn. On the number of copies of a hypergraph in another. Israel Journal of Mathematics, 105:251-256, 1998.
8. H. Garcia-Molina, J. Widom, and J. Ullman. Database System Implementation. Prentice-Hall, 1999.
9. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25, 1993.
10. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In Proceedings of the of the 17th Annual ACMSIAM Symposium on Discrete Algorithms, pages 289-298, 2006.
11. 1-ε. Acta Math., 182(1):105-142, 1999.
12. J. H. Kim and V. H. Vu. Concentration of multivariate polynomials and its applications. Combinatorica, 20(3):417-434, 2000.
13. J. Rhadakrishnan. Entropy and counting. Available at http://www.tcs.tifr. res.in/~jaikumar/mypage.html.
14. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.