Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
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)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Theory of Relational Databases
Theory of Relational Databases
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A backtracking-based algorithm for hypertree decomposition
Journal of Experimental Algorithmics (JEA)
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
A greedy algorithm for constructing a low-width generalized hypertree decomposition
Proceedings of the 13th International Conference on Database Theory
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
New structural decomposition techniques for constraint satisfaction problems
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
| Hi-index | 0.00 |
Evaluating a conjunctive database query is known to be equivalent to solving a constraint satisfaction problem. These problems are NP-complete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. This paper surveys recent results by the authors on tractable classes of conjunctive queries and constraint satisfaction problems and presents a new decomposition algorithm for such problems.