{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:32Z","timestamp":1750219952770,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P30930-N35"],"award-info":[{"award-number":["P30930-N35"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["RP\\R1\\201074"],"award-info":[{"award-number":["RP\\R1\\201074"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524153","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"325-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth"],"prefix":"10.1145","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"given":"Matthias","family":"Lanzinger","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"given":"Cem","family":"Okulmus","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.04.013"},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"20th International Conference on Database Theory, ICDT 2017, March 21--24","volume":"68","author":"Afrati F. N.","year":"2017","unstructured":"F. N. Afrati , M. R. Joglekar , C. R\u00e9 , S. Salihoglu , and J. D. Ullman . GYM: A multiround distributed join algorithm. In M. Benedikt and G. Orsi, editors , 20th International Conference on Database Theory, ICDT 2017, March 21--24 , 2017 , Venice, Italy , volume 68 of LIPIcs, pages 4: 1 -- 4 :18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2017. F. N. Afrati, M. R. Joglekar, C. R\u00e9, S. Salihoglu, and J. D. Ullman. GYM: A multiround distributed join algorithm. In M. Benedikt and G. Orsi, editors, 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy, volume 68 of LIPIcs, pages 4:1--4:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2017."},{"key":"e_1_3_2_1_5_1","first-page":"98","volume-title":"Alternation. In 17th Annual Symposium on Foundations of Computer Science","author":"Chandra A. K.","year":"1976","unstructured":"A. K. Chandra and L. J. Stockmeyer . Alternation. In 17th Annual Symposium on Foundations of Computer Science , Houston, Texas, USA, 25- -27 October 1976 , pages 98 -- 108 . IEEE Computer Society, 1976. A. K. Chandra and L. J. Stockmeyer. Alternation. In 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25--27 October 1976, pages 98--108. IEEE Computer Society, 1976."},{"key":"e_1_3_2_1_6_1","volume-title":"A taxonomy of problems with fast parallel algorithms. Inf. Control., 64(1--3):2--21","author":"Cook S. A.","year":"1985","unstructured":"S. A. Cook . A taxonomy of problems with fast parallel algorithms. Inf. Control., 64(1--3):2--21 , 1985 . S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inf. Control., 64(1--3):2--21, 1985."},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"The PACE 2019 parameterized algorithms and computational experiments challenge: The fourth iteration (invited paper). In IPEC","volume":"148","author":"Dzulfikar M. A.","year":"2019","unstructured":"M. A. Dzulfikar , J. K. Fichte , and M. Hecher . The PACE 2019 parameterized algorithms and computational experiments challenge: The fourth iteration (invited paper). In IPEC , volume 148 of LIPIcs, pages 25: 1 -- 25 :23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik , 2019 . M. A. Dzulfikar, J. K. Fichte, and M. Hecher. The PACE 2019 parameterized algorithms and computational experiments challenge: The fourth iteration (invited paper). In IPEC, volume 148 of LIPIcs, pages 25:1--25:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2019."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98334-9_8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3440015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367849"},{"key":"e_1_3_2_1_11_1","first-page":"2573","volume-title":"Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011","author":"Ghionna L.","year":"2011","unstructured":"L. Ghionna , G. Greco , and F. Scarcello . H-DB: a hybrid quantitative-structural sql optimizer. In C. Macdonald, I. Ounis, and I. Ruthven, editors , Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011 , Glasgow, United Kingdom, October 24--28 , 2011 , pages 2573 -- 2576 . ACM, 2011. L. Ghionna, G. Greco, and F. Scarcello. H-DB: a hybrid quantitative-structural sql optimizer. In C. Macdonald, I. Ounis, and I. Ruthven, editors, Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24--28, 2011, pages 2573--2576. ACM, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508028.2505987"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622519.1622530"},{"key":"e_1_3_2_1_14_1","volume-title":"Fast parallel hypertree decompositions in logarithmic recursion depth. CoRR, abs\/2104.13793","author":"Gottlob G.","year":"2021","unstructured":"G. Gottlob , M. Lanzinger , C. Okulmus , and R. Pichler . Fast parallel hypertree decompositions in logarithmic recursion depth. CoRR, abs\/2104.13793 , 2021 . G. Gottlob, M. Lanzinger, C. Okulmus, and R. Pichler. Fast parallel hypertree decompositions in logarithmic recursion depth. CoRR, abs\/2104.13793, 2021."},{"key":"e_1_3_2_1_15_1","series-title":"LIPIcs","first-page":"1","volume-title":"MFCS","author":"Gottlob G.","year":"2020","unstructured":"G. Gottlob , M. Lanzinger , R. Pichler , and I. Razgon . Fractional covers of hypergraphs with bounded multi-intersection . In MFCS , volume 170 of LIPIcs , pages 41: 1 -- 41 :14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 2020 . G. Gottlob, M. Lanzinger, R. Pichler, and I. Razgon. Fractional covers of hypergraphs with bounded multi-intersection. In MFCS, volume 170 of LIPIcs, pages 41:1--41:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2020."},{"issue":"1","key":"e_1_3_2_1_16_1","article-title":"Complexity analysis of generalized and fractional hypertree decompositions (forthcoming)","volume":"68","author":"Gottlob G.","year":"2021","unstructured":"G. Gottlob , M. Lanzinger , R. Pichler , and I. Razgon . Complexity analysis of generalized and fractional hypertree decompositions (forthcoming) . J. ACM , 68 ( 1 ), 2021 . G. Gottlob, M. Lanzinger, R. Pichler, and I. Razgon. Complexity analysis of generalized and fractional hypertree decompositions (forthcoming). J. ACM, 68(1), 2021.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382783"},{"key":"e_1_3_2_1_19_1","volume-title":"Computing LOGCFL certificates. Theor. Comput. Sci., 270(1--2):761--777","author":"Gottlob G.","year":"2002","unstructured":"G. Gottlob , N. Leone , and F. Scarcello . Computing LOGCFL certificates. Theor. Comput. Sci., 270(1--2):761--777 , 2002 . G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL certificates. Theor. Comput. Sci., 270(1--2):761--777, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 [scheduled for","author":"Gottlob G.","year":"2020","unstructured":"G. Gottlob , C. Okulmus , and R. Pichler . Fast and parallel decomposition of constraint satisfaction problems. In C. Bessiere, editor , Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 [scheduled for July 2020 , Yokohama, Japan, postponed due to the Corona pandemic], pages 1155--1162. ijcai.org , 2020. G. Gottlob, C. Okulmus, and R. Pichler. Fast and parallel decomposition of constraint satisfaction problems. In C. Bessiere, editor, Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 [scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic], pages 1155--1162. ijcai.org, 2020."},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"A backtracking-based algorithm for hypertree decomposition","volume":"13","author":"Gottlob G.","year":"2008","unstructured":"G. Gottlob and M. Samer . A backtracking-based algorithm for hypertree decomposition . ACM Journal of Experimental Algorithmics , 13 : 1 :1.1--1:1.19, 2008 . G. Gottlob and M. Samer. A backtracking-based algorithm for hypertree decomposition. ACM Journal of Experimental Algorithmics, 13:1:1.1--1:1.19, 2008.","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.01.012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/196"},{"key":"e_1_3_2_1_26_1","volume-title":"Distributed computing in practice: the condor experience. Concurrency - Practice and Experience, 17(2--4):323--356","author":"Thain D.","year":"2005","unstructured":"D. Thain , T. Tannenbaum , and M. Livny . Distributed computing in practice: the condor experience. Concurrency - Practice and Experience, 17(2--4):323--356 , 2005 . D. Thain, T. Tannenbaum, and M. Livny. Distributed computing in practice: the condor experience. Concurrency - Practice and Experience, 17(2--4):323--356, 2005."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 7th International Conference on Very Large Databases, VLDB 1981","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for acyclic database schemes . In Proceedings of the 7th International Conference on Very Large Databases, VLDB 1981 , Cannes, pages 82--94. VLDB , 1981 . M. Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Databases, VLDB 1981, Cannes, pages 82--94. VLDB, 1981."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524153","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:04Z","timestamp":1750182544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":26,"alternative-id":["10.1145\/3517804.3524153","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524153","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}