Weighted hypertree decompositions and optimal query plans

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

Volumn 23, Issue , 2004, Pages 210-221

  Scarcello, Francesco ^a   Greco, Gianluigi ^a   Leone, Nicola ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; DATABASE SYSTEMS; GRAPH THEORY; OPTIMIZATION; TREES (MATHEMATICS);

DEGREE OF CYCLICITY; HYPERTREES; OPTIMIZED QUERIES; STRUCTURAL DECOMPOSITION;

QUERY LANGUAGES;

EID: 3142685197     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055587     Document Type: Conference Paper

References (47)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. S. Abiteboul and O.M. Duschka. Complexity of Answering Queries Using Materialized Views. In Proc. of the PODS'98, Seattle, Washington, pp. 254-263, 1998.
3. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30(3), pp. 479-513, 1983.
4. P.A. Bernstein and N. Goodman. The power of natural semijoins. SIAM Journal on Computing, 10(4), pp. 751-771, 1981.
5. H.L. Bodlaender and F.V. Fomin. Tree decompositions with small cost. In In Proc. of SWAT'02, Springer-Verlag LNCS 2368, pp. 378-387, 2002.
6. J. Cai, V.T. Chakaravarthy, R. Kaushik, and J.F. Naughton. On the Complexity of Join Predicates. In Proc. of PODS'01, 2001.
7. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 26:114-133, 1981.
8. A.K. Chandra and P.M. Merlin. Optimal Implementation of Conjunctive Queries in relational Databases. In Proc. of the STOC'77, pp.77-90, 1977.
9. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. Theoretical Computer Science, 239(2), pp. 211-229, 2000.
10. R. Dechter. Constraint networks. In Stuart C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pp. 276-285. Wiley, 1992. Volume 1, second edition.
11. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
12. R. Fagin, A.O. Mendelzon, and J.D. Ullman. A simplified universal relation assumption and its properties. ACM Transactions on Database Systems, 7(3), pp. 343-360, 1982.
13. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. Journal of the ACM, 49(6), pp. 716-752, 2002.
14. E.C. Freuder. A sufficient condition for backtrack-bounded search. Journal of ACM, 32(4), pp. 755-761, 1985.
15. M. Frick and M. Grohe. Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM, 48(6), pp. 1184-1206, 2001.
16. H. Garcia-Molina, J. Ullman, and J. Widom. Database system implementation. Prentice Hall, 2000.
17. P. Harvey and A. Ghose. Reducing Redundancy in the Hypertree Decomposition Scheme, In Proc. of 5th IEEE International Conference on Tools with Artificial Intelligence, pp. 474-481, 2003.
18. Y.E. Ioannidis. Query Optimization. The Computer Science and Engineering Handbook, pp. 1038-1057, 1997.
19. Y.E. Ioannidis. The History of Histograms (abridged). In In Proc. of VLDB'03, Berlin, Germany, pp. 19-30, 2003.
20. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2), pp. 243-282, 2000.
21. N. Goodman and O. Shmueli. Tree queries: a simple class of relational queries. ACM Transactions on Database Systems, 7(4), pp. 653-6773, 1982.
22. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64(3), pp. 579-627, 2002.
23. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, 124(2), pp.243-282, 2000.
24. G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. Journal of the ACM, 48(3), pp. 431-498, 2001.
25. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions: A survey. In In Proc. of MFCS'2001, pp. 37-57, 2001.
26. G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL Certificates. Theoretical Computer Science, 270(1-2), pp. 761-777, 2002.
27. S.H. Greibach. The Hardest Context-Free Language. SIAM Journal on Computing, 2(4):304-310, 1973.
28. M. Grohe. The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. In Proc. of FOCS'03, Cambridge, MA, United States, pp. 552-561, 2003.
29. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Proc. of STOC'01, Heraklion, Crete, Greece, pp. 657-666, 2001.
30. M. Gyssens, P.G. Jeavons, and D.A. Cohen. Decomposing constraint satisfaction problems using database techniques. Journal of Algorithms, 66, pp. 57-89, 1994.
31. D.S. Johnson, A Catalog of Complexity Classes, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 67-161, 1990.
32. P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61(2), pp. 302-332, 2000.
33. D. Maier. The Theory of Relational Databases. Computer Science Press, 1986.
34. C.H. Papadimitriou and M. Yannakakis. On the complexity of database queries. In Proc. of PODS'97, Tucson, Arizona, pp. 12-19, 1997.
35. J. Pearson and P.G. Jeavons. A Survey of Tractable Constraint Satisfaction Problems, CSD-TR-97-15, Royal Holloway, Univ. of London, 1997.
36. N. Robertson and P.D. Seymour. Graph minors ii. algorithmic aspects of tree width. Journal of Algorithms, 7, pp. 309-322, 1986.
37. W.L. Ruzzo. Tree-size bounded alternation. Journal of Cumputer and System Sciences, 21, pp. 218-235, 1980.
38. D. Saccà. Closures of database hypergraphs. Journal of the ACM, 32(4), pp. 774-803, 1985.
39. S. Skyum and L.G. Valiant. A complexity theory based on Boolean algebra. Journal of the ACM, 32:484-502, 1985.
40. I.H. Sudborough. Time and Tape Bounded Auxiliary Pushdown Automata. In Mathematical Foundations of Computer Science (MFCS'77), LNCS 53, Springer-Verlag, pp.493-503, 1977.
41. Francesco Scarcello and Alfredo Mazzitelli. The hypertree decompositions homepage, since 2002. http://wwwinfo.deis.unical.it/~frank/Hypertrees/
42. J. D. Ullman. Principles of Database and Knowledge Base Systems. Computer Science Press, 1989.
43. M. Vardi. Complexity of relational query languages. In Proc. of STOC'82, San Francisco, California, United States, pp. 137-146, 1982.
44. M. Vardi. Constraint Satisfaction and Database Theory. Tutorial at the 19th ACM Symposium on Principles of Database Systems (PODS'00). Currently available at: http://www.cs.rice.edu/~vardi/papers/pods00t.ps.gz.
45. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB'81, Cannes, France, pp. 82-94, 1981.
46. C.T. Yu and M.Z. Özsoyoǧlu. On determining tree-query membership of a distributed query. Infor, 22(3), pp. 261-282, 1984.
47. C.T. Yu, M.Z. Özsoyoǧlu, and k. Lam. Optimization of Distributed Tree Queries. Journal of Computer and System Sciences, 29(3), pp. 409-445, 1984.