{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T23:28:18Z","timestamp":1771889298541,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Engineering and Physical Sciences Research Council","award":["EP\/M025268\/VADA"],"award-info":[{"award-number":["EP\/M025268\/VADA"]}]},{"name":"Austrian Science Fund","award":["P25518-N23 and P30930-N35"],"award-info":[{"award-number":["P25518-N23 and P30930-N35"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3196959.3196962","type":"proceedings-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T12:26:14Z","timestamp":1526387174000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["General and Fractional Hypertree Decompositions"],"prefix":"10.1145","author":[{"given":"Wolfgang","family":"Fischl","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[{"name":"University of Oxford & TU Wien, Oxford, Austria"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915213"},{"key":"e_1_3_2_1_2_1","volume-title":"Old Techniques for New Join Algorithms: A Case Study in RDF Processing. CoRR abs\/1602.03557","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 abs\/1602.03557 ( 2016 ). 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 abs\/1602.03557 (2016). http:\/\/arxiv.org\/abs\/1602.03557"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.v47:4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.04.013"},{"key":"e_1_3_2_1_5_1","volume-title":"Ullman","author":"Afrati Foto N.","year":"2014","unstructured":"Foto N. Afrati , Manas Joglekar , Christopher R\u00e9 , Semih Salihoglu , and Jeffrey D . Ullman . 2014 . GYM : A Multiround Join Algorithm In MapReduce. CoRR abs\/1410.4156 (2014). Foto N. Afrati, Manas Joglekar, Christopher R\u00e9, Semih Salihoglu, and Jeffrey D. Ullman. 2014. GYM: A Multiround Join Algorithm In MapReduce. CoRR abs\/1410.4156 (2014)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5802\/aif.938"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556579"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149196"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570718"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_15"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.001"},{"key":"e_1_3_2_1_16_1","volume-title":"Vardi","author":"Dalmau V\u00edctor","year":"2002","unstructured":"V\u00edctor Dalmau , Phokion G. Kolaitis , and Moshe Y . Vardi . 2002 . Constraint Satisfaction, Bounded Treewidth , and Finite-Variable Logics. In Proceedings of CP 2002 (Lecture Notes in Computer Science), Vol. 2470 . Springer , 310--326. V\u00edctor Dalmau, Phokion G. Kolaitis, and Moshe Y. Vardi. 2002. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In Proceedings of CP 2002 (Lecture Notes in Computer Science), Vol. 2470. Springer, 310--326."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90037-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305948"},{"key":"e_1_3_2_1_19_1","volume-title":"Handbook of combinatorics (vol. 1)","author":"Duchet Pierre","unstructured":"Pierre Duchet . 1996. Hypergraphs . In Handbook of combinatorics (vol. 1) . MIT Press , 381--432. Pierre Duchet. 1996. Hypergraphs. In Handbook of combinatorics (vol. 1). MIT Press, 381--432."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"e_1_3_2_1_21_1","volume-title":"General and Fractional Hypertree Decompositions: Hard and Easy Cases. CoRR abs\/1611.01090","author":"Fischl Wolfgang","year":"2016","unstructured":"Wolfgang Fischl , Georg Gottlob , and Reinhard Pichler . 2016. General and Fractional Hypertree Decompositions: Hard and Easy Cases. CoRR abs\/1611.01090 ( 2016 ). http:\/\/arxiv.org\/abs\/1611.01090 Wolfgang Fischl, Georg Gottlob, and Reinhard Pichler. 2016. General and Fractional Hypertree Decompositions: Hard and Easy Cases. CoRR abs\/1611.01090 (2016). http:\/\/arxiv.org\/abs\/1611.01090"},{"key":"e_1_3_2_1_22_1","unstructured":"Woflgang Fischl Georg Gottlob and Reinhard Pichler. 2016. Generalized and Fractional Hypertree Decompositions: Empirical Results. forthcoming report. (2016).  Woflgang Fischl Georg Gottlob and Reinhard Pichler. 2016. Generalized and Fractional Hypertree Decompositions: Empirical Results. forthcoming report. (2016)."},{"key":"e_1_3_2_1_23_1","volume-title":"Tractable Cases for Recognizing Low Fractional Hypertree Width. viXra.org e-prints viXra:1708.0373","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 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 viXra:1708.0373 (2017). http:\/\/vixra.org\/abs\/1708.0373"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of AAAI","author":"Freuder Eugene C.","year":"1990","unstructured":"Eugene C. Freuder . 1990 . Complexity of K-Tree Structured Constraint Satisfaction Problems . In Proceedings of AAAI 1990. AAAI Press \/ The MIT Press, 4--9. Eugene C. Freuder. 1990. Complexity of K-Tree Structured Constraint Satisfaction Problems. In Proceedings of AAAI 1990. AAAI Press \/ The MIT Press, 4--9."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508028.2505987"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206036"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109590"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380867"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90003-5"},{"key":"e_1_3_2_1_33_1","volume-title":"Advances in Data Base Theory","author":"Gyssens Marc","unstructured":"Marc Gyssens and Jan Paredaens . 1984. A Decomposition Methodology for Cyclic Databases . In Advances in Data Base Theory : Volume 2 . Springer , 85--122. Marc Gyssens and Jan Paredaens. 1984. A Decomposition Methodology for Cyclic Databases. In Advances in Data Base Theory: Volume 2. Springer, 85--122."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.02.024"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745776"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902280"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"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.1007\/s00224-009-9248-9"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535926"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.002"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Dan Olteanu and Jakub Z\u00e1vodny. 2015. Size bounds for factorised representations  Dan Olteanu and Jakub Z\u00e1vodny. 2015. Size bounds for factorised representations","DOI":"10.1145\/2656335"},{"key":"e_1_3_2_1_43_1","volume-title":"2","author":"Trans ACM","year":"2015","unstructured":"of query results. ACM Trans . Database Syst . 40, 1 ( 2015 ), 2 . of query results. ACM Trans. Database Syst. 40, 1 (2015), 2."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00164-E"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2764946"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9977-x"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"e_1_3_2_1_49_1","volume-title":"Proceedings of VLDB","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis . 1981 . Algorithms for Acyclic Database Schemes . In Proceedings of VLDB 1981. IEEE Computer Society, 82--94. Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In Proceedings of VLDB 1981. IEEE Computer Society, 82--94."}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196959.3196962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:34Z","timestamp":1750208914000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196962"}},"subtitle":["Hard and Easy Cases"],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":49,"alternative-id":["10.1145\/3196959.3196962","10.1145\/3196959"],"URL":"https:\/\/doi.org\/10.1145\/3196959.3196962","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}