Tractable counting of the answers to conjunctive queries.
Reinhard PichlerSebastian SkritekPublished in: J. Comput. Syst. Sci. (2013)
Keyphrases
- conjunctive queries
- np complete
- complexity of query answering
- bounded treewidth
- query answering
- queries using views
- query evaluation
- hypertree decomposition
- data complexity
- integrity constraints
- query answers
- query language
- data exchange
- decision procedures
- database theory
- special case
- query rewriting
- fixed parameter tractable
- computational complexity
- query containment
- answering queries
- probabilistic databases
- dl lite
- unions of conjunctive queries
- np hard
- data integration
- datalog programs
- constraint satisfaction problems
- computational problems
- incomplete information
- regular path queries
- boolean expressions
- relational queries
- containment of conjunctive queries
- database