[Zurück]

W. Fischl, D. Longo, G. Gottlob, R. Pichler:
"HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings";
Vortrag: SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Niederlande; 30.06.2019 - 05.07.2019; in: "Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019", ACM, (2019), ISBN: 978-1-4503-6227-6; S. 464 - 480.

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.

hypergraph decomposition methods, query answering, con-straint satisfaction

http://dx.doi.org/10.1145/3294052.3319683

Projektleitung Reinhard Pichler:
HyperTrac