Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries and Constraint Satisfaction Problems.
Gianluigi GrecoFrancesco ScarcelloPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction problems
- conjunctive queries
- np complete
- constraint satisfaction
- data complexity
- np hard
- constraint propagation
- constraint programming
- query rewriting
- satisfiability problem
- database theory
- computational complexity
- search space
- query containment
- query evaluation
- constraint solving
- constraint problems
- query answering
- bounded treewidth
- tractable classes
- search algorithm
- reasoning problems
- decision procedures
- finite domain
- integrity constraints
- constraint networks
- phase transition
- computational problems
- tree decomposition
- query language
- special case
- sat problem
- global constraints
- decomposition methods
- ordering heuristics
- datalog programs
- data exchange
- data model
- xml documents
- databases