Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth
Summary: Proposes log-k-decomp, the first parallel-friendly hypertree-decomposition algorithm using balanced-separator pruning and only logarithmic recursion depth. Empirical results on HyperBench show large speedups over prior solvers, enabling practical parallel HD computation for database and CSP workloads. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Georg Gottlob
- 2. Matthias Lanzinger
- 3. Cem Okulmus
- 4. Reinhard Pichler
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,372 | Soft and Constrained Hypertree Width | 2025 | PODS | 4.1905499e-05 |
| 10,493 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.1905499e-05 |
| 11,135 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 341 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00026850764 |
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
| 5,076 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.709895e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,739 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 4.2895392e-05 |
| 10,604 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1905499e-05 |
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.380727e-05 |
| 1,322 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012595941 |
| 5,076 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.709895e-05 |
| 2,804 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1039107e-05 |
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
| 1,039 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014488271 |
| 10,493 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.1905499e-05 |
| 11,135 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.1905499e-05 |