Hypertree Decompositions and Tractable Queries 1

1 A preliminary version of this paper appeared in the ‘‘Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems (PODS’99),’’ pp. 21–32, Philadelphia, May 1999. Research supported by FWF (Austrian Science Funds) under the Project Z29-INF. Part of the work of Francesco Scarcello has been carried out while visiting the Technische Universität Wien. Part of the work of Nicola Leone has been carried out while he was with the Technische Universität Wien. Georg Gottlob

[1]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[2]  YannakakisMihalis,et al.  On the Desirability of Acyclic Database Schemes , 1983 .

[3]  Xiaolei Qian,et al.  Query folding , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[4]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[5]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[6]  Wolfgang Bibel,et al.  Constraint Satisfaction from a Deductive Viewpoint , 1988, Artif. Intell..

[7]  Anand Rajaraman,et al.  Conjunctive query containment revisited , 1997, Theor. Comput. Sci..

[8]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[9]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[10]  Georg Gottlob,et al.  Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2001, PODS '01.

[11]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[12]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[15]  Marc Gyssens,et al.  A Decomposition Methodology for Cyclic Databases , 1982, Advances in Data Base Theory.

[16]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[17]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[18]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[19]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[20]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[21]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[22]  Georg Gottlob,et al.  On Tractable Queries and Constraints , 1999, DEXA.

[23]  Nathan Goodman,et al.  Tree queries: a simple class of relational queries , 1982, TODS.

[24]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[25]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

[26]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[27]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[28]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[29]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[30]  Philip A. Bernstein,et al.  Power of Natural Semijoins , 1981, SIAM J. Comput..

[31]  Clement Yu,et al.  On determining tree query membership of a distributed query , 1980 .

[32]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[33]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[34]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[35]  Ivan Hal Sudborough.  Time and Tape Bounded Auxiliary Pushdown Automata , 1977, MFCS.

[36]  Marina Moscarini,et al.  Recognition Algorithms and Design Methodologies for Acyclic Database Schemes , 1986, Adv. Comput. Res..

[37]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 2001, JACM.

[38]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[39]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..