{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T11:29:41Z","timestamp":1779103781351,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4619,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0004-3702(00)00078-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:55:14Z","timestamp":1027630514000},"page":"243-282","source":"Crossref","is-referenced-by-count":177,"title":["A comparison of structural CSP decomposition methods"],"prefix":"10.1016","volume":"124","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Scarcello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00078-3_BIB001","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Problems easy for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/S0004-3702(00)00078-3_BIB002","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0004-3702(00)00078-3_BIB003","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0210059","article-title":"The power of natural semijoins","volume":"10","author":"Bernstein","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(00)00078-3_BIB004","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0004-3702(88)90023-9","article-title":"Constraint satisfaction from a deductive viewpoint","volume":"35","author":"Bibel","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB005","series-title":"Proc. MFCS-97, Bratislava","first-page":"19","article-title":"Treewidth: Algorithmic techniques and results","volume":"1295","author":"Bodlaender","year":"1997"},{"issue":"2","key":"10.1016\/S0004-3702(00)00078-3_BIB006","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","article-title":"Conjunctive query containment revisited","volume":"239","author":"Chekuri","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(00)00078-3_BIB007","series-title":"Encyclopedia of Artificial Intelligence","first-page":"276","article-title":"Constraint networks","author":"Dechter","year":"1992"},{"issue":"1","key":"10.1016\/S0004-3702(00)00078-3_BIB008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network based heuristics for constraint satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB009","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(00)00078-3_BIB010","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0004-3702(00)00078-3_BIB011","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB012","series-title":"Proc. AAAI-90, Boston, MA","article-title":"Complexity of k-tree structured constraint satisfaction problems","author":"Freuder","year":"1990"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB013","series-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB014","doi-asserted-by":"crossref","unstructured":"N. Goodman, O. Shmueli, Syntactic characterization of tree database schemas, J. ACM 30 (4) 767\u2013786","DOI":"10.1145\/2157.322405"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB015","series-title":"Proc. FOCS-98, Palo Alto, CA","first-page":"706","article-title":"The complexity of acyclic conjunctive queries","author":"Gottlob","year":"1998"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB016","series-title":"Proc. PODS-99, Philadelphia, PA","article-title":"Hypertree decompositions and tractable queries","author":"Gottlob","year":"1999"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB017","series-title":"Proc. Conference on Database and Expert Systems Applications DEXA-99, Florence","first-page":"1","article-title":"On tractable queries and constraints","volume":"1677","author":"Gottlob","year":"1999"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB018","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","article-title":"Decomposing constraint satisfaction problems using database techniques","volume":"66","author":"Gyssens","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB019","series-title":"Advances in Database Theory, Vol. 2","first-page":"85","article-title":"A decomposition methodology for cyclic databases","author":"Gyssens","year":"1984"},{"issue":"4","key":"10.1016\/S0004-3702(00)00078-3_BIB020","doi-asserted-by":"crossref","DOI":"10.1145\/263867.263489","article-title":"Closure properties of constraints","volume":"44","author":"Jeavons","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB021","series-title":"Proc. Symp. on Principles of Database Systems (PODS-98) Seattle, WA","first-page":"205","article-title":"Conjunctive-query containment and constraint satisfaction","author":"Kolaitis","year":"1998"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB022","author":"Maier","year":"1986"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB023","author":"Pearson","year":"1997"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB024","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph Minors II. Algorithmic aspects of tree width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB025","series-title":"Proc. IJCAI-81, Vancouver, BC","article-title":"A new method for solving constraint satisfaction problems","author":"Seidel","year":"1981"},{"key":"10.1016\/S0004-3702(00)00078-3_BIB026","series-title":"Proc. Internat. Conference on Very Large Data Bases (VLDB-81), Cannes, France","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000783?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000783?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T23:25:49Z","timestamp":1555802749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0004370200000783"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00078-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}