Size and treewidth bounds for conjunctive queries

Journal of the ACM

Volumn 59, Issue 3, 2012, Pages

  Gottlob, Georg ^a   Lee, Stephanie Tien ^b   Valiant, Gregory ^c   Valiant, Paul ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Berkeley ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Conjunctive queries; Database theory; Size bounds; Treewidth

Indexed keywords

INFORMATION THEORY; QUERY PROCESSING;

COLORING SCHEMES; CONJUNCTIVE QUERIES; DATA BASE THEORY; FUNCTIONAL DEPENDENCY; LOWER AND UPPER BOUNDS; QUERY VARIABLES; SIZE BOUNDS; TREE-WIDTH;

QUERY LANGUAGES;

EID: 84864697427     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2220357.2220363     Document Type: Conference Paper

References (37)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. AHO, A. V., BEERI, C., AND ULLMAN, J. D. 1979a. The theory of joins in relational databases. ACM Trans. Datab. Syst. 4, 3, 297-314.
3. AHO, A. V., SAGIV, Y., AND ULLMAN, J. D. 1979b. Equivalence of relational expressions. SIAM J. Comput. 8, 2, 218-246.
4. ARNBORG, S., LAGERGREN, J., AND SEESE, D. 1991. Easy problems for tree-decomposable graphs. J. Algor. 12, 2, 308-340.
5. ATSERIAS, A., GROHE, M., AND MARX, D. 2008. Size bounds and query plans for relational joins. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
6. BEERI, C. AND VARDI, M. Y. 1984. A proof procedure for data dependencies. J. ACM 31, 4, 718-741.
7. CHANDRA, A. K. AND MERLIN, P. M. 1977. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC).
8. CHAUDHURI, S. 1998. An overview of query optimization in relational systems. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
9. COURCELLE, B. 1990. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85, 1, 12-75.
10. DEUTSCH, A., POPA, L., AND TANNEN, V. 2006. Query reformulation with constraints. ACM SIGMOD Record 35, 1, 65-73.
11. DOUGHERTY, R., FREILING, C., AND ZEGER, K. 2007. Networks, matroids, and non-shannon information inequalities. IEEE Trans. Inf. Theory 53, 6, 1949-1969.
12. DOWLING, W. F. AND GALLIER, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Logic Prog. 3, 1, 267-284.
13. FAGIN, R., KOLAITIS, P. G., MILLER, R. J., AND POPA, L. 2003. Data exchange: Semantics and query answering. In Proceedings of the 9th International Conference on Database Theory (ICDT).
14. FLUM, J., FRICK, M., AND GROHE, M. 2002. Query evaluation via tree-decompositions. J. ACM 49, 6, 716-752.
15. GOTTLOB, G. AND LEE, S. T. 2007. A logical approach to multicut problems. Inf. Proc. Letters 103, 4, 136-141.
16. GOTTLOB, G., LEE, S. T., AND VALIANT, G. 2009. Size and treewidth bounds for conjunctive queries. In Proceedings of the 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS).
17. GOTTLOB, G., PICHLER, R., AND WEI, F. 2007. Efficient datalog abduction through bounded treewidth. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence. AAAI Press, 1626-1631.
18. GROHE, M. AND MARX, D. 2006. Constraint solving via fractional edge covers. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA).
19. HAAS, P. J., NAUGHTON, J. F., SESHADRI, S., AND SWAMI, A. N. 1996. Selectivity and cost estimation for joins based on random sampling. J. Comput. Syst. Sci. 52, 3, 550-569.
20. JARKE, M. AND KOCH, J. 1984. Query optimization in database systems. ACM Comput. Surv. 16, 2, 111-152.
21. KOLAITIS, P. 2005. Schema mappings, data exchange, and metadata management. In Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
22. LENZERINI, M. 2002. Data integration: A theoretical perspective. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
23. LEVY, A. Y., MENDELZON, A. O., AND SAGIV, Y. 1995. Answering queries using views. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
24. MAIER, D., MENDELZON, A. O., AND SAGIV, Y. 1979. Testing implications of data dependencies. ACM Trans. Datab. Syst. 4, 4, 455-469.
25. MATÚŠ, F. 2007a. Infinitely many information inequalities. In Proceedings of the IEEE International Symposium on Information Theory.
26. MATÚŠ, F. 2007b. Two constructions on limits of entropy functions. IEEE Trans. Inf. Theory 53, 1, 320-330.
27. OLKEN, F. AND ROTEM, D. 1990. Random sampling from database files: A survey. In Proceedings of the 5th International Workshop on Statistical and Scientific Data Management.
28. PIPPENGER, N. 1986. What are the laws of information theory? In Proceedings of the Special Problems on Communication and Computation Conference.
29. ROBERTSON, N. AND SEYMOUR, P. D. 1986a. Graph minors II: Algorithmic aspects of tree-width. J. Algor. 7, 3, 309-322.
30. ROBERTSON, N. AND SEYMOUR, P. D. 1986b. Graph minors. V. Excluding a planar graph. J. Combinat. Theory 41, 1, 92-114.
31. SHAMIR, A. 1979. How to share a secret. Commun. ACM 22, 11, 612-613.
32. SWAMI, A. N. AND SCHIEFER, K. B. 1994. On the estimation of join result sizes. In Proceedings of the 4th International Conference on Extending Database Technology - Advances in Database Technology (EDBT'94).
33. THORUP, M. 1998. Structured programs have small tree-width and good register allocation. Inf. Comput. 142, 318-332.
34. VALIANT, G. AND VALIANT, P. 2009. Size bounds for conjunctive queries with general functional dependencies. http://arxiv.org/abs/0909.2030.
35. YEUNG, R. W. 2008. Information Theory and Network Coding. Springer Publishing Company, Incorporated.
36. ZHANG, Z. AND YEUNG, R. W. 1997. A non-shannon-type conditional inequality of information quantities. IEEE Trans. Inf. Theory 43, 6, 1982-1986.
37. ZHANG, Z. AND YEUNG, R. W. 1998. On characterization of entropy function via information inequalities. IEEE Trans. Inf. Theory 44, 4, 1440-1452.