DBScholar

Back to papers

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)

Paper ID
1879
Venue
PODS
Year
2022
Pagerank
5.3868551e-05
Overall Rank
8,675 | 40.49%
DOI
10.1145/3517804.3524153

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers