Tractable Conjunctive Queries over Static and Dynamic Relations.
Ahmet KaraZheng LuoMilos NikolicDan OlteanuHaozhe ZhangPublished in: CoRR (2024)
Keyphrases
- conjunctive queries
- np complete
- bounded treewidth
- integrity constraints
- query evaluation
- query answering
- data complexity
- hypertree decomposition
- query language
- special case
- np hard
- query containment
- data exchange
- probabilistic databases
- boolean expressions
- conjunctive regular path queries
- datalog programs
- decision procedures
- query rewriting
- computational complexity
- dl lite
- satisfiability problem
- regular path queries
- unions of conjunctive queries
- knowledge base
- conp complete
- answering queries
- relational data model
- data management
- tree width
- fixed parameter tractable
- relational databases
- conjunctive query containment