Structural tractability of counting of solutions to conjunctive queries.
Arnaud DurandStefan MengelPublished in: ICDT (2013)
Keyphrases
- conjunctive queries
- np complete
- query evaluation
- data complexity
- query answering
- integrity constraints
- query language
- query containment
- containment of conjunctive queries
- special case
- query rewriting
- data exchange
- optimal solution
- bounded treewidth
- datalog programs
- decision procedures
- probabilistic databases
- computational complexity
- satisfiability problem
- incomplete information
- constraint satisfaction
- dl lite
- boolean expressions
- deductive databases
- query optimization
- constraint satisfaction problems
- relational queries
- np hard
- data model
- answering queries using views
- conjunctive regular path queries