When is approximate counting for conjunctive queries tractable?
Marcelo ArenasLuis Alberto CroquevielleRajesh JayaramCristian RiverosPublished in: STOC (2021)
Keyphrases
- conjunctive queries
- np complete
- bounded treewidth
- query answering
- query evaluation
- integrity constraints
- data complexity
- hypertree decomposition
- query language
- database theory
- special case
- query rewriting
- fixed parameter tractable
- data exchange
- probabilistic databases
- query containment
- containment of conjunctive queries
- computational complexity
- decision procedures
- datalog programs
- boolean expressions
- np hard
- satisfiability problem
- regular path queries
- tree width
- conp complete
- conjunctive query containment
- conjunctive regular path queries
- relational algebra
- constraint satisfaction problems
- database systems