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 (University of Oxford)
- 2. Matthias Lanzinger (University of Oxford)
- 3. Cem Okulmus (Vienna University of Technology)
- 4. Reinhard Pichler (Vienna University of Technology)
BibTeX Citation
@inproceedings{gottlob_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524153},
doi = {10.1145/3517804.3524153},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gottlob, Georg and Lanzinger, Matthias and Okulmus, Cem and Pichler, Reinhard},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
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 |
|---|---|---|---|---|
| 211 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00024797217 |
| 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00015095061 |
| 5,461 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 6.2090515e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB |
| 2 | 9,301 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 3 | 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 4 | 5,461 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS |
| 5 | 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |
| 6 | 6,159 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS |
| 7 | 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS |
| 8 | 10,762 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD |
| 9 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 10 | 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |