Sciweavers

11 search results - page 3 / 3
» View-Based Query Processing and Constraint Satisfaction
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 5 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...