Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems.
Georg GottlobMatthias LanzingerReinhard PichlerPublished in: CoRR (2018)
Keyphrases
- constraint satisfaction problems
- conjunctive queries
- np complete
- constraint satisfaction
- data complexity
- query answering
- query evaluation
- constraint programming
- np hard
- constraint propagation
- integrity constraints
- combinatorial problems
- arc consistency
- decision procedures
- constraint solving
- database theory
- query rewriting
- computational problems
- data exchange
- search space
- satisfiability problem
- query language
- special case
- query containment
- hypertree decomposition
- datalog programs
- phase transition
- bounded treewidth
- sat problem
- computational complexity
- constraint networks
- databases
- schema mappings
- objective function
- tree decomposition
- database systems