Hypertree Decompositions: A Survey

Authors:
Georg Gottlob;Nicola Leone;Francesco Scarcello
Affiliations:
-;-;-
Venue:
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Year:
2001

Citing 30
Cited 12

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Tree clustering for constraint networks (research note)

Artificial Intelligence
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
The monadic second-order logic of graphs VII: graphs as relational structures

Theoretical Computer Science - Special issue on logic and applications to computer science
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Decomposing constraint satisfaction problems using database techniques

Artificial Intelligence
Bounded tree-width and LOGCFL

Journal of Algorithms
Parallel evaluation of multi-join queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Closure properties of constraints

Journal of the ACM (JACM)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Hypertree decompositions and tractable queries

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Acyclic hypergraph projections

Journal of Algorithms
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Conjunctive query containment revisited

Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A comparison of structural CSP decomposition methods

Artificial Intelligence
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Query Evaluation via Tree-Decompositions

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Subsumption Algorithms Based on Search Trees

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Theory of Relational Databases

Theory of Relational Databases
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7

On Consistency and Width Notions for Constraint Programs with Algebraic Constraints

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
A unified theory of structural tractability for constraint satisfaction problems

Journal of Computer and System Sciences
An Algorithmic Study of Deduction in Simple Conceptual Graphs with Classical Negation

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Typed guarded decompositions for constraint satisfaction

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint satisfaction with bounded treewidth revisited

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Worst-case optimal join algorithms: [extended abstract]

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Overlapping coalition formation games: charting the tractability frontier

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
On minimal constraint networks

Artificial Intelligence
Satisfiability of acyclic and almost acyclic CNF formulas

Theoretical Computer Science
Deciding monotone duality and identifying frequent itemsets in quadratic logspace

Proceedings of the 32nd symposium on Principles of database systems
Decomposing combinatorial auctions and set packing problems

Journal of the ACM (JACM)
Taming the infinite chase: query answering under expressive relational constraints

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys recent results related to the concept of hypertree decomposition and the associated notion of hypertree width. A hypertree decomposition of a hypergraph (similar to a tree decomposition of a graph) is a suitable clustering of its hyperedges yielding a tree or a forest. Important NP hard problems become tractable if restricted to instances whose associated hypergraphs are of bounded hypertree width. We also review a number of complexity results on problems whose structure is described by acyclic or nearly acyclic hypergraphs.