Query answering exploiting structural properties

SIGMOD Record

Volumn 34, Issue 3, 2005, Pages 91-99

  Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GAME THEORY; PROBLEM SOLVING; QUERY LANGUAGES;

CYCLICITY; HYPERGRAPHS; HYPERTREE WIDTH; STRUCTURAL PROPERTIES;

STRUCTURE (COMPOSITION);

EID: 31444434116     PISSN: 01635808     EISSN: 01635808     Source Type: Journal    
DOI: 10.1145/1084805.1084827     Document Type: Review

References (49)

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 PODS'98, pp. 254-263, Seattle, Washington, 1998.
3. I. Adler, G. Gottlob, and M. Grohe. Hypertree-Width and Related Hypergraph Invariants. In Proc. of EuroComb'05, Berlin, 2005.
4. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. Onthe desirability of acyclic database schemes. J.ACM, 30(3):479-513, 1983.
5. P.A. Bernstein and N. Goodman. The power of natural semijoins. SIAM J. Comput., 10(4):751-771, 1981.
6. A.K. Chandra and P.M. Merlin. Optimal Implementation of Conjunctive Queries in relational Databases. In Proc. of STOC'77, pp.77-90, Boulder, Colorado, USA, 1977.
7. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. TCS, 239(2):211-229, 2000.
8. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
9. R. Fagin, A.O. Mendelzon, and J.D. Ullman. A simplified universal relation assumption and its properties. ACM TODS, 7(3):343-360, 1982.
10. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. J.ACM, 49(6):716-752, 2002.
11. E.C. Freuder. A sufficient condition for backtrack-bounded search. J.ACM, 32(4):755-761, 1985.
12. H. Garcia-Molina, J. Ullman, and J. Widom. Database system implementation. Prentice Hall, 2000.
13. Y.E. Ioannidis Query Optimization. The Computer Science and Engineering Handbook, pp. 1038-1057, 1997.
14. N. Goodman and O. Shmueli. Tree queries: a simple class of relational queries. ACM TODS, 7(4):653-6773, 1982.
15. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artif. Intell., 124(2):243-282, 2000.
16. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Advanced parallel algonthms for processing acyclic conjunctive queries, rules, and constraints. In Proc. of the Conference on Software Engineering and Knowledge Engineering (SEKE'00), pp. 167-176, Chicago, USA, 2000.
17. G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. J.ACM, 48(3):431-498, 2001.
18. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions: A survey. In In Proc. of MFCS'200I, pp. 37-57, Marianske Lazne, Czech Republic, 2001.
19. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. JCSS, 64(3):579-627, 2002.
20. G. Gottlob, N. Leone, and F. Scarcello Computing LOGCFL Certificates. TCS, 270(1-2):761-777, 2002.
21. G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. JCSS, 66(4):775-808, 2003.
22. G. Gottlob, M. Grohe, N. Musliu, M. Samer, and F. Scarcello. Hypertree Decompositions: Structure, Algorithms, and Applications. In Proc. of WG'05, Metz, France, 2005.
23. E. Grädel. On the Restraining Power of Guards. J. Symb. Logic, Vol. 64, pp. 1719-1742, 1999.
24. M. Grohe. The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. In Proc. of FOCS'03, pp 552-561, Cambridge, MA, USA, 2003.
25. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Proc. of STOC'01, pp. 657-666, Heraklion, Crete, Greece, 2001.
26. M. Gyssens, P.G. Jeavons, and D.A. Cohen Decomposing constraint satisfaction problems using database techniques. J. of Algorithms, 66:57-89, 1994.
27. D.S. Johnson, A Catalog of Complexity Classes, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexly, pp. 67-161, 1990.
28. P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. JCSS, 61(2):302-332, 2000.
29. T. Korimort. Constraint Satisfaction Problems - Heuristic Decomposition PhD thesis, Vienna University of Technology, April 2003.
30. D. Maier. The Theory of Relational Databases. Computer Science Press, 1986.
31. B.J. McMahan, G. Pan, P.Porter, and M.Y. Vardi. Projection Pushing Revisited. In Proc of EDBT'04, pp. 441-458, Heraklion, Crete, Greece, 2004.
32. B. McMahan. Bucket Elimination and Hypertree Decompositions. Implementation report, DBAI, TU Vienna, 2004.
33. C.H. Papadimitriou and M. Yannakakis. On the complexity of database queries. In Proc. of PODS'97, pp. 12-19, Tucson, Arizona, USA, 1997.
34. O. Reingold. Undirected ST-Connectivity in Log-Space, manuscript, 2004, currently available at http://www.wisdom.weizmann.ac.il/~reingold/publications/ sl.ps
35. N. Robertson and P.D. Seymour Graph minors ii. algorithmic aspects of tree width. J. of Algorisms, 7:309-322, 1986.
36. W.L. Ruzzo. Tree-size bounded alternation. JCSS, 21:218-235, 1980.
37. D. Saccà. Closures of database hypergraphs. J.ACM, 32(4) 774-803, 1985.
38. P.D. Seymour and R. Thomas. Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory B, 58:22-33, 1993.
39. F. Scarcello. Answering Queries: Tractable Cases and Optimizations. Technical Report D2.R3, Project "Integrazione, Warehousing e Mining di Sorgenti Eterogenee (MURST COFIN-2000)," 2001.
40. Francesco Scarcello and Alfredo Mazzitelli. The hypertree decompositions homepage, since 2002. http://wwwinfo.deis.unical.it/~frank/Hypertrees/
41. Francesco Scarcello, Gianluigi Greco, and Nicola Leone. Weighted Hypertree Decompositions and Optimal Query Plans. In Proc. of PODS'04, pp. 210-221, Paris, 2004.
42. R.E. Taijan, and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM J. Comput., 13(3):566-579, 1984.
43. J. D. Ullman. Principles of Database and Knowledge Base Systems. Computer Science Press, 1989.
44. A.N. Wilschut, J. Flokara, and P. M.G. Apers. Parallel evaluation of multi-join queries. In Proc. of SIGMOD'95, San Jose, CA, USA, 1995.
45. J. Van Benthem. Dynamic Bits and Pieces. ILLC Research Report, University of Amsterdam, 1997.
46. M. Vardi. Complexity of relational query languages. In Proc. of STOC'82, pp. 137-146, San Francisco, CA, USA, 1982.
47. M. Vaidi. Constraint Satisfaction and Database Theory. Tutorial at PODS'00, Dallas, Texas, USA, 2000.
48. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB'81, pp. 82-94, Cannes, France, 1981.
49. C.T. Yu and M.Z. Özsoyoǧlu. On determining tree-query membership of a distributed query. Infor, 22(3):261-282, 1984.