{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:05Z","timestamp":1773481865075,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Austrian Science Fund (FWF)","award":["P30930-N35"],"award-info":[{"award-number":["P30930-N35"]}]},{"name":"Austrian Science Fund (FWF)","award":["W1255-N23"],"award-info":[{"award-number":["W1255-N23"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3294052.3319683","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T12:56:45Z","timestamp":1560776205000},"page":"464-480","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["HyperBench"],"prefix":"10.1145","author":[{"given":"Wolfgang","family":"Fischl","sequence":"first","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[{"name":"Vienna University of Technology & University of Oxford, Oxford, United Kingdom"}]},{"given":"Davide Mario","family":"Longo","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"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","volume-title":"Old Techniques for New Join Algorithms: A Case Study in RDF Processing. CoRR","author":"Aberger Christopher R.","year":"2016","unstructured":"Christopher R. Aberger , Susan Tu , Kunle Olukotun , and Christopher R\u00e9. 2016. Old Techniques for New Join Algorithms: A Case Study in RDF Processing. CoRR , Vol. abs\/ 1602 .03557 ( 2016 ). arxiv: 1602.03557 http:\/\/arxiv.org\/abs\/1602.03557 Christopher R. Aberger, Susan Tu, Kunle Olukotun, and Christopher R\u00e9. 2016. Old Techniques for New Join Algorithms: A Case Study in RDF Processing. CoRR, Vol. abs\/1602.03557 (2016). arxiv: 1602.03557 http:\/\/arxiv.org\/abs\/1602.03557"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.04.013"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-150694"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850586"},{"key":"e_1_3_2_1_7_1","unstructured":"Gilles Audemard Fr\u00e9d\u00e9ric Boussemart Christophe Lecoutre and C\u00e9dric Piette. 2016. XCSP3: an XML-based format designed to represent combinatorial constrained problems. http:\/\/www.xcsp.org\/  Gilles Audemard Fr\u00e9d\u00e9ric Boussemart Christophe Lecoutre and C\u00e9dric Piette. 2016. XCSP3: an XML-based format designed to represent combinatorial constrained problems. http:\/\/www.xcsp.org\/"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556579"},{"key":"e_1_3_2_1_9_1","unstructured":"Michael Benedikt. 2017. CQ benchmarks. Personal Communication.  Michael Benedikt. 2017. CQ benchmarks. Personal Communication."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034796"},{"key":"e_1_3_2_1_11_1","volume-title":"MaxSAT Benchmarks based on Determining Generalized Hypertree-width. MaxSAT Evaluation 2017: Solver and Benchmark Descriptions","author":"Berg Jeremias","year":"2017","unstructured":"Jeremias Berg , Neha Lodha , Matti J\"arvisalo, and Stefan Szeider . 2017. MaxSAT Benchmarks based on Determining Generalized Hypertree-width. MaxSAT Evaluation 2017: Solver and Benchmark Descriptions , Vol. B-2017-- 2 ( 2017 ), 22. Jeremias Berg, Neha Lodha, Matti J\"arvisalo, and Stefan Szeider. 2017. MaxSAT Benchmarks based on Determining Generalized Hypertree-width. MaxSAT Evaluation 2017: Solver and Benchmark Descriptions, Vol. B-2017--2 (2017), 22."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3167892.3167895"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056109"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/861888"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132573"},{"key":"e_1_3_2_1_17_1","volume-title":"CP 2018, Lille, France, August 27--31, 2018, Proceedings (Lecture Notes in Computer Science), John N. Hooker (Ed.)","volume":"11008","author":"Fichte Johannes Klaus","year":"2018","unstructured":"Johannes Klaus Fichte , Markus Hecher , Neha Lodha , and Stefan Szeider . 2018 . An SMT Approach to Fractional Hypertree Width. In Principles and Practice of Constraint Programming - 24th International Conference , CP 2018, Lille, France, August 27--31, 2018, Proceedings (Lecture Notes in Computer Science), John N. Hooker (Ed.) , Vol. 11008 . Springer, 109--127. Johannes Klaus Fichte, Markus Hecher, Neha Lodha, and Stefan Szeider. 2018. An SMT Approach to Fractional Hypertree Width. In Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27--31, 2018, Proceedings (Lecture Notes in Computer Science), John N. Hooker (Ed.), Vol. 11008. Springer, 109--127."},{"key":"e_1_3_2_1_18_1","volume-title":"Tractable Cases for Recognizing Low Fractional Hypertree Width. viXra.org e-prints","author":"Fischl Wolfgang","year":"2017","unstructured":"Wolfgang Fischl , Georg Gottlob , and Reinhard Pichler . 2017. Tractable Cases for Recognizing Low Fractional Hypertree Width. viXra.org e-prints , Vol. viXra: 1708 .0373 ( 2017 ). http:\/\/vixra.org\/abs\/1708.0373 Wolfgang Fischl, Georg Gottlob, and Reinhard Pichler. 2017. Tractable Cases for Recognizing Low Fractional Hypertree Width. viXra.org e-prints, Vol. viXra:1708.0373 (2017). http:\/\/vixra.org\/abs\/1708.0373"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196962"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816654"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367849"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2064023"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412229"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2014.993507"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882957"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, SARA 2011","author":"Karakashian Shant","year":"2011","unstructured":"Shant Karakashian , Robert J. Woodward , and Berthe Y. Choueiry . 2011. Reformulating R(*, m)C with Tree Decomposition . In Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, SARA 2011 , Parador de Cardona, Cardona, Catalonia, Spain, July 17--18 , 2011 ., Michael R. Genesereth and Peter Z. Revesz (Eds.). AAAI, 62--69. http:\/\/www.aaai.org\/ocs\/index.php\/SARA\/SARA11\/paper\/view\/4234 Shant Karakashian, Robert J. Woodward, and Berthe Y. Choueiry. 2011. Reformulating R(*, m)C with Tree Decomposition. In Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, SARA 2011, Parador de Cardona, Cardona, Catalonia, Spain, July 17--18, 2011., Michael R. Genesereth and Peter Z. Revesz (Eds.). AAAI, 62--69. http:\/\/www.aaai.org\/ocs\/index.php\/SARA\/SARA11\/paper\/view\/4234"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967101"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902280"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA@AI*IA","author":"Lalou Mohammed","year":"2009","unstructured":"Mohammed Lalou , Zineb Habbas , and Kamal Amroun . 2009. Solving Hypertree Structured CSP: Sequential and Parallel Approaches . In Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA@AI*IA 2009 , Reggio Emilia, Italy, December 11--12, 2009 (CEUR Workshop Proceedings), Marco Gavanelli and Toni Mancini (Eds.), Vol. 589 . CEUR-WS. org. http:\/\/ceur-ws.org\/Vol-589\/paper11.pdf Mohammed Lalou, Zineb Habbas, and Kamal Amroun. 2009. Solving Hypertree Structured CSP: Sequential and Parallel Approaches. In Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA@AI*IA 2009, Reggio Emilia, Italy, December 11--12, 2009 (CEUR Workshop Proceedings), Marco Gavanelli and Toni Mancini (Eds.), Vol. 589. CEUR-WS.org. http:\/\/ceur-ws.org\/Vol-589\/paper11.pdf"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0480-7"},{"key":"e_1_3_2_1_37_1","volume-title":"Larry Gonz\u00e1 lez, Julius Gonsior, and Adrian Bielefeldt.","author":"Malyshev Stanislav","year":"2018","unstructured":"Stanislav Malyshev , Markus Kr\u00f6 tzsch , Larry Gonz\u00e1 lez, Julius Gonsior, and Adrian Bielefeldt. 2018 . Getting the Most Out of Wikidata: Semantic Technology Usage in Wikipedia's Knowledge Graph. In The Semantic Web - ISWC 2018 - 17th International Semantic Web Conference, Monterey, CA, USA, October 8--12, 2018, Proceedings, Part II (Lecture Notes in Computer Science), Denny Vrandecic, Kalina Bontcheva, Mari Carmen Su\u00e1 rez-Figueroa, Valentina Presutti, Irene Celino, Marta Sabou, Lucie-Aim\u00e9 e Kaffee, and Elena Simperl (Eds.), Vol. 11137 . Springer , 376--394. Stanislav Malyshev, Markus Kr\u00f6 tzsch, Larry Gonz\u00e1 lez, Julius Gonsior, and Adrian Bielefeldt. 2018. Getting the Most Out of Wikidata: Semantic Technology Usage in Wikipedia's Knowledge Graph. In The Semantic Web - ISWC 2018 - 17th International Semantic Web Conference, Monterey, CA, USA, October 8--12, 2018, Proceedings, Part II (Lecture Notes in Computer Science), Denny Vrandecic, Kalina Bontcheva, Mari Carmen Su\u00e1 rez-Figueroa, Valentina Presutti, Irene Celino, Marta Sabou, Lucie-Aim\u00e9 e Kaffee, and Elena Simperl (Eds.), Vol. 11137. Springer, 376--394."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721845"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.002"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2764945"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999299.1999306"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/767141.767146"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1223810.1223867"},{"key":"e_1_3_2_1_45_1","unstructured":"Werner Schafhauser. 2006. New heuristic methods for tree decompositions and generalized hypertree decompositions . Master's thesis. Technische Universit\"at Wien.  Werner Schafhauser. 2006. New heuristic methods for tree decompositions and generalized hypertree decompositions . Master's thesis. Technische Universit\"at Wien."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_22"},{"key":"e_1_3_2_1_47_1","unstructured":"Transaction Processing Performance Council (TPC). 2014. TPC-H decision support benchmark. http:\/\/www.tpc.org\/tpch\/default.asp  Transaction Processing Performance Council (TPC). 2014. TPC-H decision support benchmark. http:\/\/www.tpc.org\/tpch\/default.asp"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2764946"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3294052.3319683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:47Z","timestamp":1750208507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319683"}},"subtitle":["A Benchmark and Tool for Hypergraphs and Empirical Findings"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":49,"alternative-id":["10.1145\/3294052.3319683","10.1145\/3294052"],"URL":"https:\/\/doi.org\/10.1145\/3294052.3319683","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}