Submodular width is approximated within 3/2 by a branchwidth parameter from edge separations and admissible submodular costs, and satisfies subw(H) = Omega(ghw(H) / log ghw(H)) under natural conditions.
Hypertree decompositions and tractable queries
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.
citing papers explorer
-
Cuts and Gauges for Submodular Width
Submodular width is approximated within 3/2 by a branchwidth parameter from edge separations and admissible submodular costs, and satisfies subw(H) = Omega(ghw(H) / log ghw(H)) under natural conditions.
-
Work-Efficient Query Evaluation in Constant Time with PRAMs
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.