A greedy algorithm for constructing a low-width generalized hypertree decomposition.

Kaoru Katayama Tatsuro Okawara Yuka Ito

Published in: ICDT (2010)

Keyphrases

greedy algorithm
hypertree decomposition
decomposition methods
greedy algorithms
hypertree width
worst case
dynamic programming
database theory
objective function
greedy strategy
set cover
influence maximization
constraint satisfaction
knapsack problem
greedy heuristic
conjunctive queries
lower bound