Balanced queries: divide and conquer

DOI10.1007/978-3-642-15155-2_6zbMATH Open1287.68067OpenAlexW1854390228WikidataQ59259552 ScholiaQ59259552MaRDI QIDQ3586071FDOQ3586071

Authors: Dmitri Akatov, Georg Gottlob 

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_6

Recommendations

• Hypertree decompositions and tractable queries
• Weighted hypertree decompositions and optimal query plans
• HyperBench. A benchmark and tool for hypergraphs and empirical findings
• Graph-Theoretic Concepts in Computer Science
• Complexity Analysis of Generalized and Fractional Hypertree Decompositions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Balanced queries: divide and conquer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586071)