HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Summary: HyperBench: a public benchmark and web workbench with implemented hypergraph-decomposition algorithms (including new practical methods) for hw, ghw, and fhw on diverse CQ/CSP instances. Supplies a large curated dataset and reproducible empirical analyses that reveal practical performance, limits, and trade-offs of decomposition techniques. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wolfgang Fischl (Vienna University of Technology)
- 2. Georg Gottlob (University of Oxford; Vienna University of Technology)
- 3. Davide Mario Longo (Vienna University of Technology)
- 4. Reinhard Pichler (Vienna University of Technology)
BibTeX Citation
@inproceedings{fischl_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319683},
doi = {10.1145/3294052.3319683},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Fischl, Wolfgang and Gottlob, Georg and Longo, Davide Mario and Pichler, Reinhard},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,675 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth | 2022 | PODS | 5.3868551e-05 |
| 9,693 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 5.2351259e-05 |
| 9,961 | Threshold Queries in Theory and in the Wild | 2022 | VLDB | 5.1879626e-05 |
| 10,653 | Soft and Constrained Hypertree Width | 2025 | PODS | 5.093636e-05 |
| 10,762 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 5.093636e-05 |
| 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 5.093636e-05 |
| 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |
| 2 | 13,457 | CBench: Demonstrating Comprehensive Evaluation of Question Answering Systems over Knowledge Graphs Through Deep Analysis of Benchmarks | 2021 | VLDB |
| 3 | 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS |
| 4 | 6,159 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS |
| 5 | 10,653 | Soft and Constrained Hypertree Width | 2025 | PODS |
| 6 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 7 | 8,675 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth | 2022 | PODS |
| 8 | 10,762 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD |
| 9 | 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 10 | 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |