Generalized hypertree decompositions: NP-hardness and tractable variants

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

Volumn , Issue , 2007, Pages 13-22

  Gottlob, Georg ^a   Miklós, Zoltan ^a   Schwentick, Thomas ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Acyclic; Conjunctive query; Hypergraph; Hypertree decomposition; NP complete; Tractable; Tree projection problem

Indexed keywords

CONJUNCTIVE QUERY; GENERAL HYPERTREE DECOMPOSITION (GHD); HYPERTREE DECOMPOSITION; TREE PROJECTION PROBLEM;

COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; QUERY PROCESSING;

TREES (MATHEMATICS);

EID: 35448946460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265533     Document Type: Conference Paper

References (26)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. I. Adler. Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory, 47(4):275-296, 2004.
3. I. Adler, G. Gottlob, and M. Grohe. Hypertree-width and related hypergraph invariants. In Proceedings of the 3rd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'05), volume AE of DMTCS Proceedings Series, pages 5-10, 2005.
4. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25:2-23, 1985.
5. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree decomposable graphs. Journal of Algorithms, 12(2):308-340, Jun 1991.
6. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30(3):479-513, 1983.
7. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. In ACM Symposium on Theory of Computing (STOC'77), pages 77-90, 1977.
8. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. Theor. Comput. Sci., 239(2):211-229, 2000.
9. D. A. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In IJCAI'05, pages 72-77, 2005.
10. B. Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B, pages 193-242. Elsevier Science Publishers, 1990.
11. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. J. ACM, 49(6):716-752, 2002.
12. M. C. Golumbic, H. Kaplan, and R. Shamir. Graph sandwich problems. Journal of Algorithms, 19:449-473, 1995.
13. M. C. Golumbic and A. Wassermann. Complexity and algorithms for graph and hypergraph sandwich problems. Graphs and Combinatorics, 14:223-239, 1998.
14. N. Goodman and O. Shmueli. The tree projection theorem and relational query processing. JCSS, 28(1):60-79, 1984.
15. G. Gottlob, V. Gurvich, and Z. Miklós. On the complexity of the acyclic hypergraph sandwich problem. Technical Report DBAI-TR-2005-51, Vienna University of Technology, 2005.
16. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2):243-282, 2000.
17. G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. Journal of the ACM, 48(3):431-498, 2001.
18. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences (JCSS), 64(3):579-627, May 2002.
19. G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences (JCSS), 66(4):775-808, 2003.
20. G. Gottlob, Z. Miklós, and T. Schwentick. Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants. Technical report DBAI-TR-2007-55, Vienna, University of Technology, 2007. http://www.dbai.tuwien. ac.at/staff/miklos/ghw.pdf.
21. G. Gottlob, R. Pichler, and F. Wei. Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In Proc. AAAI 2006. AAAI Press, 2006.
22. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In SODA, pages 289-298, 2006.
23. A. Lustig and O. Shmueli. Acyclic hypergraph projections. Journal of Algorithms, 30(2):400-422, 1999.
24. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309-322, 1986.
25. Y. Sagiv and O. Shmueli. Solving queries by tree projections. ACM Transactions on Database Systems, 18(3):487-511, 1993.
26. F. Scarcello, G. Greco, and N. Leone. Weighted hypertree decompositions and optimal query plans. In Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 210-221, 2004.