Reducing Redundancy in the Hypertree Decomposition Scheme

Authors:
Peter Harvey;Aditya Ghose
Affiliations:
-;-
Venue:
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Year:
2003

Citing 0
Cited 7

Weighted hypertree decompositions and optimal query plans

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Weighted hypertree decompositions and optimal query plans

Journal of Computer and System Sciences
A backtracking-based algorithm for hypertree decomposition

Journal of Experimental Algorithmics (JEA)
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A greedy algorithm for constructing a low-width generalized hypertree decomposition

Proceedings of the 13th International Conference on Database Theory
New structural decomposition techniques for constraint satisfaction problems

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypertree decomposition is a powerful technique for transforming near-acyclic CSPs into acyclic CSPs. Acyclic CSPs have efficient, polynomial time solving techniques, and so these conversions are of interest to the constraints community. We present here an improvement on the opt-k-decomp algorithm for finding an optimal hypertree decomposition.