Generalized hypertree decompositions: np-hardness and tractable variants.
Georg GottlobZoltán MiklósThomas SchwentickPublished in: PODS (2007)
Keyphrases
- hypertree decomposition
- np hardness
- np hard
- decomposition methods
- hypertree width
- approximation algorithms
- database theory
- polynomially solvable
- constraint satisfaction problems
- conjunctive queries
- mixed integer
- optimal solution
- constraint satisfaction
- np complete
- genetic algorithm
- open problems
- decomposition method
- data model
- feature selection