FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs.
Matthias LanzingerIgor RazgonPublished in: CoRR (2023)
Keyphrases
- hypertree width
- hypertree decomposition
- conjunctive queries
- bounded treewidth
- fixed parameter tractable
- decomposition methods
- tree width
- np complete
- query answering
- np hard
- computational problems
- query evaluation
- expressive power
- integrity constraints
- approximation algorithms
- structural properties
- database theory
- tree decomposition
- special case
- query language
- data exchange
- constraint satisfaction problems
- constraint networks
- global constraints
- database
- constraint satisfaction
- database systems