A short note on the counting complexity of conjunctive queries.
Stefan MengelPublished in: CoRR (2021)
Keyphrases
- conjunctive queries
- conjunctive query containment
- data complexity
- query answering
- combined complexity
- conp complete
- query evaluation
- np complete
- integrity constraints
- conjunctive regular path queries
- query language
- decision procedures
- data exchange
- query rewriting
- special case
- lower complexity
- bounded treewidth
- computational complexity
- containment of conjunctive queries
- query containment
- probabilistic databases
- expressive power
- datalog programs
- dl lite
- fixed parameter tractable
- boolean expressions
- databases
- data mining
- objective function
- pspace complete
- relational queries
- database
- transitive closure