{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:46Z","timestamp":1759637806285},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"37-57","source":"Crossref","is-referenced-by-count":21,"title":["Hypertree Decompositions: A Survey"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Scarcello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CAAP\u201996","author":"L. Bachmair","year":"1996","unstructured":"L. Bachmair, Ta Chen, C. R. Ramakrishnan, and I. V. Ramakrishnan. Subsumption Algorithms Based on Search Trees. Proc. CAAP\u201996, Springer LNCS Vol. 1059."},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the Desiderability of Acyclic Database Schemes. Journal of ACM, 30(3):479\u2013513, 1983.","journal-title":"Journal of ACM"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"P. A. Bernstein","year":"1981","unstructured":"P. A. Bernstein, and N. Goodman. The power of natural semijoins. SIAM J. Computing, 10(4):751\u2013771, 1981.","journal-title":"SIAM J. Computing"},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. L. Bodlaender","year":"1996","unstructured":"H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Computing, 25(6):1305\u20131317, 1996.","journal-title":"SIAM J. Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"A. K. Chandra and P. M. Merlin. Optimal Implementation of Conjunctive Queries in relational Databases. Proc. STOC\u201977, pp. 77\u201390, 1977.","DOI":"10.1145\/800105.803397"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"Ch. Chekuri","year":"2000","unstructured":"Ch. Chekuri and A. Rajaraman. Conjunctive Query Containment Revisited. Theoretical Computer Science, 239(2):211\u2013229, 2000.","journal-title":"Theoretical Computer Science"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"B. Courcelle. Graph Rewriting: an algebraic and logic approach. Chapter 5 in Handbook of Theor. Comp. Sci., vol. B, J. Van Leeuwen ed., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90148-9","volume":"101","author":"B. Courcelle","year":"1992","unstructured":"B. Courcelle: Monadic second-order logic of graphs VII: Graphs as relational structures, in Theoretical Computer Science, Vol 101, pp. 3\u201333 (1992).","journal-title":"Theoretical Computer Science"},{"key":"5_CR9","unstructured":"R. Dechter. Constraint Networks. In Encyclopedia of Artificial Intelligence, second edition, Wiley and Sons, pp. 276\u2013285, 1992."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, pp. 353\u2013366, 1989.","DOI":"10.1016\/0004-3702(89)90037-4"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. J. of the ACM, 30(3):514\u2013550, 1983.","journal-title":"J. of the ACM"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"T. Feder and M. Y. Vardi. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM J. Comput., 28(1):57\u2013104, 1998.","journal-title":"SIAM J. Comput."},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-44503-X_2","volume-title":"Proc. ofICDT\u201901","author":"J. Flum","year":"2001","unstructured":"J. Flum, M. Frick, and M. Grohe. Query Evaluation via Tree-Decomposition. In Proc. ofICDT\u201901, Springer LNCS, Vol. 1973, pp. 22\u201338, 2001."},{"key":"5_CR14","unstructured":"E. C. Freuder. Complexity of K-Tree Structured Constraint Satisfaction Problems. Proc. of AAAI\u201990, 1990."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"H. Gaifman. On local and nonlocal properties. In Logic Colloquium\u2019 81, pp. 105\u2013135, J. Stern ed., North Holland, 1982.","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"5_CR16","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman and Comp., NY, USA, 1979."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. The Complexity of Acyclic Conjunctive Queries. Journal of the ACM, 48(3), 2001. Preliminary version in FOCS\u201998.","DOI":"10.1145\/382780.382783"},{"key":"5_CR18","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL Certificates. Theoretical Computer Sciences, to appear. Preliminary version in ICALP\u201999."},{"key":"5_CR19","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. Hypertree Decompositions and Tractable Queries. JCSS. to appear. Preliminary version in PODS\u201999."},{"key":"5_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/10703163","volume-title":"Proc. DEXA\u2019 99","author":"G. Gottlob","year":"1999","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. \u201cOn Tractable Queries and Constraints,\u201d in Proc. DEXA\u2019 99, Florence, 1999, LNCS 1677, pp. 1\u201315, Springer."},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, 124(2):243\u2013282, 2000. Preliminary version in IJCAI\u201999.","journal-title":"Artificial Intelligence"},{"key":"5_CR22","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. \u201cAdvanced Parallel Algorithms for Processing Acyclic Conjunctive Queries, Rules, and Constraints,\u201d Proc. SEKE00, pp. 167\u2013176, KSI Ed., Chicago, USA, July 6\u20138, 2000."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. \u201cRobbers, Marshals, and Guards: Game-Theoretic and Logical Characterizations of Hypertree Width,\u201c in Proc. PODS\u201901.","DOI":"10.1145\/375551.375579"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"G. Gottlob and R. Pichler. Hypergraphs in Model Checking: Acyclicity and Hypertree-Width Versus Clique-Width. Proc. ICALP 2001, to appear.","DOI":"10.1007\/3-540-48224-5_58"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"M. Grohe, T. Schwentick, and L. Segoufin. When is the Evaluation of Conjunctive Queries Tractable? Proc. ACM STOC 2001.","DOI":"10.1145\/380752.380867"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"M. Gyssens, P. G. Jeavons, and D. A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66:57\u201389, 1994.","journal-title":"Artificial Intelligence"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"M. Gyssens, and J. Paredaens. A Decomposition Methodology for Cyclic Databases. In Advances in Database Theory, vol. 2, 1984.","DOI":"10.1007\/978-1-4615-9385-0_4"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"P. Jeavons, D. Cohen, and M. Gyssens. Closure Properties of Constraints. Journal of the ACM, 44(4):527\u2013548.","DOI":"10.1145\/263867.263489"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"D. S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2, pp. 67\u2013161. Elsevier Science Publishers B. V. (North-Holland), 1990.","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"Ph. G. Kolaitis","year":"2000","unstructured":"Ph. G. Kolaitis and M. Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System Sciences, 61:302\u2013332, 2000.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1998.0965","volume":"30","author":"A. Lustig","year":"1999","unstructured":"A. Lustig and O. Shmueli. Acyclic Hypergraph Projections. J. of Algorithms, 30:400\u2013422, 1999.","journal-title":"J. of Algorithms"},{"key":"5_CR32","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1986","unstructured":"D. Maier. The Theory of Relational Databases, Rochville, Md, Computer Science Press, 1986."},{"key":"5_CR33","unstructured":"J. Pearson and P. Jeavons. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Halloway University of London, 1997."},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. D. Seymour. Graph Minors II. Algorithmic Aspects of Tree-Width. J. Algorithms, 7:309\u2013322, 1986.","journal-title":"J. Algorithms"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"T. J. Schaefer. The Complexity of Satisfiability Problems. In Proc. STOC\u201978.","DOI":"10.1145\/800133.804350"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P. D. Seymour","year":"1993","unstructured":"P. D. Seymour and R. Thomas. Graph Searching and a Min-Max Theorem for Tree-Width. J. of Combinatorial Theory, Series B, 58:22\u201333, 1993.","journal-title":"J. of Combinatorial Theory, Series B"},{"issue":"3","key":"5_CR37","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan, and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Computing, 13(3):566\u2013579, 1984.","journal-title":"SIAM J. Computing"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"M. Vardi. Complexity of Relational Query Languages. In Proc. of 14th ACM STOC, pp. 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"},{"key":"5_CR39","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1006\/jagm.1994.1022","volume":"16","author":"E. Wanke","year":"1994","unstructured":"E. Wanke. Bounded Tree-Width and LOGCFL. Journal of Algorithms, 16:470\u2013491, 1994.","journal-title":"Journal of Algorithms"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"A. N. Wilschut, J. Flokstra, and P. M. G. Apers. Parallel evaluation of multi-join queries. In Proc. of SIGMOD\u201995, San Jose, CA USA, pp. 115\u2013126, 1995.","DOI":"10.1145\/223784.223803"},{"key":"5_CR41","unstructured":"M. Yannakakis. Algorithms for Acyclic Database Schemes. Proc. VLDB\u201981, pp. 82\u201394, C. Zaniolo and C. Delobel Eds., Cannes, France, 1981."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:27:59Z","timestamp":1556818079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}