Fast parallel hypertree decompositions in logarithmic recursion depth
type: Item
instance of: scholarly article
title: Fast parallel hypertree decompositions in logarithmic recursion depth
DOI: 10.1145/3638758
author: Georg Gottlob
author: Matthias Lanzinger
author: Cem Okulmus
author: Reinhard Pichler
published in: ACM Transactions on Database Systems
publication date: 2024-04-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 7839909
zbMATH Keywords: hypergraph decomposition
zbMATH Keywords: hypertree width
zbMATH Keywords: parallel algorithms
MaRDI profile type: Publication
cites work: Hypertree width and related hypergraph invariants
cites work: GYM: A Multiround Distributed Join Algorithm
cites work: Q4694755
cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth
cites work: A taxonomy of problems with fast parallel algorithms
cites work: The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
cites work: Degrees of acyclicity for hypergraphs and relational database schemes
cites work: HyperBench
cites work: Q5395721
cites work: Q5715720
cites work: Q5089208
cites work: Complexity Analysis of Generalized and Fractional Hypertree Decompositions
cites work: A comparison of structural CSP decomposition methods
cites work: The complexity of acyclic conjunctive queries
cites work: Computing LOGCFL certificates
cites work: Hypertree decompositions and tractable queries
cites work: Generalized hypertree decompositions: NP-hardness and tractable variants
cites work: Fast and parallel decomposition of constraint satisfaction problems
cites work: A backtracking-based algorithm for hypertree decomposition
cites work: Tractable counting of the answers to conjunctive queries
cites work: Tree-size bounded alternation
description: scientific article; zbMATH DE number 7839909