Wolfgang Fischl
Reinhard Pichler
ABSTRACT
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed - giving rise to different notions of width, noticeably, plain, generalized, and fractional hypertree width (hw, ghw, and fhw). Given the increasing interest in using such decomposition methods in practice, a publicly accessible repository of decomposition software, as well as a large set of benchmarks, and a web-accessible workbench for inserting, analysing, and retrieving hypergraphs are called for. We address this need by providing (i) concrete implementations of hypergraph decompositions (including new practical algorithms), (ii) a new, comprehensive benchmark of hypergraphs stemming from disparate CQ and CSP collections, and (iii) HyperBench, our new web-interface for accessing the benchmark and the results of our analyses. In addition, we describe a number of actual experiments we carried out with this new infrastructure.
- Christopher R. Aberger, Andrew Lamb, Susan Tu, Andres Nö tzli, Kunle Olukotun, and Christopher Ré. 2017. EmptyHeaded: A Relational Engine for Graph Processing. ACM Trans. Database Syst., Vol. 42, 4 (2017), 20:1--20:44. Google Scholar
Digital Library
- Christopher R. Aberger, Susan Tu, Kunle Olukotun, and Christopher Ré. 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.03557Google Scholar
- Isolde Adler, Georg Gottlob, and Martin Grohe. 2007. Hypertree width and related hypergraph invariants. Eur. J. Comb., Vol. 28, 8 (2007), 2167--2181. Google ScholarDigital Library
- Kamal Amroun, Zineb Habbas, and Wassila Aggoune-Mtalaa. 2016. A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems. AI Commun., Vol. 29, 2 (2016), 371--392.Google ScholarDigital Library
- Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, and Geoffrey Washburn. 2015. Design and Implementation of the LogicBlox System. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, Timos K. Sellis, Susan B. Davidson, and Zachary G. Ives (Eds.). ACM, 1371--1382. Google ScholarDigital Library
- Patricia C. Arocena, Boris Glavic, Radu Ciucanu, and René e J. Miller. 2015. The iBench Integration Metadata Generator. PVLDB, Vol. 9, 3 (2015), 108--119. Google ScholarDigital Library
- Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, and Cédric Piette. 2016. XCSP3: an XML-based format designed to represent combinatorial constrained problems. http://www.xcsp.org/Google Scholar
- Nurzhan Bakibayev, Tomá s Kociský, Dan Olteanu, and Jakub Zavodny. 2013. Aggregation and Ordering in Factorised Databases. PVLDB, Vol. 6, 14 (2013), 1990--2001. Google ScholarDigital Library
- Michael Benedikt. 2017. CQ benchmarks. Personal Communication.Google Scholar
- Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, and Efthymia Tsamoura. 2017. Benchmarking the Chase. In Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14--19, 2017, Emanuel Sallinger, Jan Van den Bussche, and Floris Geerts (Eds.). ACM, 37--52.Google ScholarDigital Library
- 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.Google Scholar
- Angela Bonifati, Wim Martens, and Thomas Timm. 2017. An Analytical Study of Large SPARQL Query Logs. PVLDB, Vol. 11, 2 (2017), 149--161. Google ScholarDigital Library
- Nofar Carmeli, Batya Kenig, and Benny Kimelfeld. 2017. Efficiently Enumerating Minimal Triangulations. In Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14--19, 2017, Emanuel Sallinger, Jan Van den Bussche, and Floris Geerts (Eds.). ACM, 273--287.Google ScholarDigital Library
- Ashok K. Chandra and Philip M. Merlin. 1977. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4--6, 1977, Boulder, Colorado, USA, John E. Hopcroft, Emily P. Friedman, and Michael A. Harrison (Eds.). ACM, 77--90. Google ScholarDigital Library
- Rina Dechter. 2003. Constraint Processing .Elsevier. Google ScholarDigital Library
- Uriel Feige and Mohammad Mahdian. 2006. Finding small balanced separators. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21--23, 2006, Jon M. Kleinberg (Ed.). ACM, 375--384. Google ScholarDigital Library
- 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.Google Scholar
- 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.0373Google Scholar
- Wolfgang Fischl, Georg Gottlob, and Reinhard Pichler. 2018. General and Fractional Hypertree Decompositions: Hard and Easy Cases. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10--15, 2018, Jan Van den Bussche and Marcelo Arenas (Eds.). ACM, 17--32.Google ScholarDigital Library
- Floris Geerts, Giansalvatore Mecca, Paolo Papotti, and Donatello Santoro. 2014. Mapping and cleaning. In IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014, Isabel F. Cruz, Elena Ferrari, Yufei Tao, Elisa Bertino, and Goce Trajcevski (Eds.). IEEE Computer Society, 232--243.Google ScholarCross Ref
- Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, and Francesco Scarcello. 2007. Hypertree Decompositions for Query Optimization. In Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15--20, 2007, Rada Chirkova, Asuman Dogac, M. Tamer Ö zsu, and Timos K. Sellis (Eds.). IEEE Computer Society, 36--45.Google ScholarCross Ref
- Lucantonio Ghionna, Gianluigi Greco, and Francesco Scarcello. 2011. H-DB: a hybrid quantitative-structural sql optimizer. In Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24--28, 2011, Craig Macdonald, Iadh Ounis, and Ian Ruthven (Eds.). ACM, 2573--2576. Google ScholarDigital Library
- Georg Gottlob, Gianluigi Greco, Nicola Leone, and Francesco Scarcello. 2016. Hypertree Decompositions: Questions and Answers. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, Tova Milo and Wang-Chiew Tan (Eds.). ACM, 57--74. Google ScholarDigital Library
- Georg Gottlob, Nicola Leone, and Francesco Scarcello. 2002. Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci., Vol. 64, 3 (2002), 579--627. Google ScholarDigital Library
- Georg Gottlob, Zoltá n Mikló s, and Thomas Schwentick. 2009. Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM, Vol. 56, 6 (2009), 30:1--30:32. Google ScholarDigital Library
- Georg Gottlob and Marko Samer. 2008. A backtracking-based algorithm for hypertree decomposition. ACM Journal of Experimental Algorithmics, Vol. 13 (2008), 1:1.1--1:1.19. Google ScholarDigital Library
- Martin Grohe and Dá niel Marx. 2014. Constraint Solving via Fractional Edge Covers. ACM Trans. Algorithms, Vol. 11, 1 (2014), 4:1--4:20. Google ScholarDigital Library
- Yuanbo Guo, Zhengxiang Pan, and Jeff Heflin. 2005. LUBM: A benchmark for OWL knowledge base systems. J. Web Semant., Vol. 3, 2--3 (2005), 158--182. Google ScholarDigital Library
- Zineb Habbas, Kamal Amroun, and Daniel Singer. 2015. A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems. J. Exp. Theor. Artif. Intell., Vol. 27, 5 (2015), 649--671.Google ScholarCross Ref
- Shrainik Jain, Dominik Moritz, Daniel Halperin, Bill Howe, and Ed Lazowska. 2016. SQLShare: Results from a Multi-Year SQL-as-a-Service Experiment. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, Fatma Ö zcan, Georgia Koutrika, and Sam Madden (Eds.). ACM, 281--293. Google ScholarDigital Library
- 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/4234Google Scholar
- Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, and Atri Rudra. 2016b. Joins via Geometric Resolutions: Worst Case and Beyond. ACM Trans. Database Syst., Vol. 41, 4 (2016), 22:1--22:45. Google ScholarDigital Library
- Mahmoud Abo Khamis, Hung Q. Ngo, and Atri Rudra. 2016a. FAQ: Questions Asked Frequently. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, Tova Milo and Wang-Chiew Tan (Eds.). ACM, 13--28. Google ScholarDigital Library
- 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.pdfGoogle Scholar
- Viktor Leis, Andrey Gubichev, Atanas Mirchev, Peter A. Boncz, Alfons Kemper, and Thomas Neumann. 2015. How Good Are Query Optimizers, Really? PVLDB, Vol. 9, 3 (2015), 204--215. Google ScholarDigital Library
- Viktor Leis, Bernhard Radke, Andrey Gubichev, Atanas Mirchev, Peter A. Boncz, Alfons Kemper, and Thomas Neumann. 2018. Query optimization through the looking glass, and what we found running the Join Order Benchmark. VLDB J., Vol. 27, 5 (2018), 643--668. Google ScholarDigital Library
- Stanislav Malyshev, Markus Krö tzsch, Larry Gonzá 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á rez-Figueroa, Valentina Presutti, Irene Celino, Marta Sabou, Lucie-Aimé e Kaffee, and Elena Simperl (Eds.), Vol. 11137. Springer, 376--394.Google Scholar
- Dá niel Marx. 2010. Approximating fractional hypertree width. ACM Trans. Algorithms, Vol. 6, 2 (2010), 29:1--29:17. Google ScholarDigital Library
- Lukas Moll, Siamak Tazari, and Marc Thurley. 2012. Computing hypergraph width measures exactly. Inf. Process. Lett., Vol. 112, 6 (2012), 238--242. Google ScholarDigital Library
- Dan Olteanu and Jakub Zá vodný. 2015. Size Bounds for Factorised Representations of Query Results. ACM Trans. Database Syst., Vol. 40, 1 (2015), 2:1--2:44.Google ScholarDigital Library
- Adam Perelman and Christopher Ré. 2015. DunceCap: Compiling Worst-Case Optimal Query Plans. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, Timos K. Sellis, Susan B. Davidson, and Zachary G. Ives (Eds.). ACM, 2075--2076.Google ScholarDigital Library
- Francc ois Picalausa and Stijn Vansummeren. 2011. What are real SPARQL queries like?. In Proceedings of the International Workshop on Semantic Web Information Management, SWIM 2011, Athens, Greece, June 12, 2011, Roberto De Virgilio, Fausto Giunchiglia, and Letizia Tanca (Eds.). ACM, 7. Google ScholarDigital Library
- Rachel Pottinger and Alon Y. Halevy. 2001. MiniCon: A scalable algorithm for answering queries using views. VLDB J., Vol. 10, 2--3 (2001), 182--198. Google ScholarDigital Library
- Francesco Scarcello, Gianluigi Greco, and Nicola Leone. 2007. Weighted hypertree decompositions and optimal query plans. J. Comput. Syst. Sci., Vol. 73, 3 (2007), 475--506. Google ScholarDigital Library
- Werner Schafhauser. 2006. New heuristic methods for tree decompositions and generalized hypertree decompositions . Master's thesis. Technische Universit"at Wien.Google Scholar
- Aaron Schild and Christian Sommer. 2015. On Balanced Separators in Road Networks. In Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings (Lecture Notes in Computer Science), Evripidis Bampis (Ed.), Vol. 9125. Springer, 286--297. Google ScholarDigital Library
- Transaction Processing Performance Council (TPC). 2014. TPC-H decision support benchmark. http://www.tpc.org/tpch/default.aspGoogle Scholar
- Susan Tu and Christopher Ré. 2015. DunceCap: Query Plans Using Generalized Hypertree Decompositions. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, Timos K. Sellis, Susan B. Davidson, and Zachary G. Ives (Eds.). ACM, 2077--2078. Google ScholarDigital Library
- V. N. Vapnik and A. Ya. Chervonenkis. 1971. On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability & Its Applications, Vol. 16, 2 (jan 1971), 264--280.Google ScholarCross Ref
Index Terms
- HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Recommendations
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed—giving rise to different notions of width, noticeably, plain, ...
General and Fractional Hypertree Decompositions: Hard and Easy Cases
PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsHypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering conjunctive ...
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Comments