{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:29Z","timestamp":1761620909438,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,14]],"date-time":"2004-06-14T00:00:00Z","timestamp":1087171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,14]]},"DOI":"10.1145\/1055558.1055587","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"210-221","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Weighted hypertree decompositions and optimal query plans"],"prefix":"10.1145","author":[{"given":"Francesco","family":"Scarcello","sequence":"first","affiliation":[{"name":"Universit\u00e0 della Calabria, Italy"}]},{"given":"Gianluigi","family":"Greco","sequence":"additional","affiliation":[{"name":"Universit\u00e0 della Calabria, Italy"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[{"name":"Universit\u00e0 della Calabria, Italy"}]}],"member":"320","published-online":{"date-parts":[[2004,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275516"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210059"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645901.672769"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375592"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_3_2_1_10_1","first-page":"276","volume-title":"Encyclopedia of Artificial Intelligence","author":"Dechter R.","year":"1992","unstructured":"R. Dechter . Constraint networks . In Stuart C. Shapiro, editor, Encyclopedia of Artificial Intelligence , pp. 276 -- 285 . Wiley , 1992 . Volume 1, second edition.]] R. Dechter. Constraint networks. In Stuart C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pp. 276--285. Wiley, 1992. Volume 1, second edition.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/861888"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/319732.319735"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4225"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/553977"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/951951.952258"},{"key":"e_1_3_2_1_18_1","first-page":"1038","volume-title":"Query Optimization. The Computer Science and Engineering Handbook","author":"Ioannidis Y. E.","year":"1997","unstructured":"Y. E. Ioannidis . Query Optimization. The Computer Science and Engineering Handbook , pp. 1038 -- 1057 , 1997 .]] Y. E. Ioannidis. Query Optimization. The Computer Science and Engineering Handbook, pp. 1038--1057, 1997.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315455"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/319758.319775"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382783"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645730.668191"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00108-6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202025"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946347"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380867"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90003-5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/114872.114874"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1097039"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263664"},{"key":"e_1_3_2_1_35_1","volume-title":"CSD-TR-97-15, Royal Holloway","author":"Pearson J.","year":"1997","unstructured":"J. Pearson and P. G. Jeavons . A Survey of Tractable Constraint Satisfaction Problems , CSD-TR-97-15, Royal Holloway , Univ. of London , 1997 .]] J. Pearson and P. G. Jeavons. A Survey of Tractable Constraint Satisfaction Problems, CSD-TR-97-15, Royal Holloway, Univ. of London, 1997.]]"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90036-7"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4997"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.3158"},{"key":"e_1_3_2_1_40_1","first-page":"493","volume-title":"Mathematical Foundations of Computer Science (MFCS'77), LNCS 53","author":"Sudborough I. H.","year":"1977","unstructured":"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 .]] 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.]]"},{"key":"e_1_3_2_1_41_1","volume-title":"The hypertree decompositions homepage, since","author":"Scarcello Francesco","year":"2002","unstructured":"Francesco Scarcello and Alfredo Mazzitelli . The hypertree decompositions homepage, since 2002 . https:\/\/linproxy.fan.workers.dev:443\/http\/wwwinfo.deis.unical.it\/~frank\/Hypertrees\/]] Francesco Scarcello and Alfredo Mazzitelli. The hypertree decompositions homepage, since 2002. https:\/\/linproxy.fan.workers.dev:443\/http\/wwwinfo.deis.unical.it\/~frank\/Hypertrees\/]]"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/42790"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335209"},{"key":"e_1_3_2_1_45_1","first-page":"82","volume-title":"Proc. of VLDB'81","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for acyclic database schemes . In Proc. of VLDB'81 , Cannes, France , pp. 82 -- 94 , 1981 .]] M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB'81, Cannes, France, pp. 82--94, 1981.]]"},{"issue":"3","key":"e_1_3_2_1_46_1","first-page":"261","article-title":"On determining tree-query membership of a distributed query","volume":"22","author":"Yu C. T.","year":"1984","unstructured":"C. T. Yu and M. Z. \u00d6zsoyo\u01e7lu . On determining tree-query membership of a distributed query . Infor , 22 ( 3 ), pp. 261 -- 282 , 1984 .]] C. T. Yu and M. Z. \u00d6zsoyo\u01e7lu. On determining tree-query membership of a distributed query. Infor, 22(3), pp. 261--282, 1984.]]","journal-title":"Infor"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90007-2"}],"event":{"name":"SIGMOD\/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Paris France","acronym":"SIGMOD\/PODS04"},"container-title":["Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1055558.1055587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/1055558.1055587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:27Z","timestamp":1750264287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1055558.1055587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,14]]},"references-count":47,"alternative-id":["10.1145\/1055558.1055587","10.1145\/1055558"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/1055558.1055587","relation":{},"subject":[],"published":{"date-parts":[[2004,6,14]]},"assertion":[{"value":"2004-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}