Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation.
Matthias LanzingerPublished in: PODS (2021)
Keyphrases
- conjunctive queries
- containment of conjunctive queries
- query answering
- np complete
- bounded treewidth
- datalog programs
- data exchange
- integrity constraints
- query containment
- null values
- data complexity
- deductive databases
- query rewriting
- query evaluation
- computational complexity
- regular path queries
- probabilistic databases
- query language
- databases
- constraint satisfaction
- answering queries
- decision procedures
- logic programming
- logic programs
- dl lite
- inclusion dependencies
- boolean expressions
- conp complete
- np hard
- relational queries
- queries using views
- predicate logic
- satisfiability problem
- schema mappings
- transitive closure
- relational algebra
- spatial databases
- incomplete information
- data management
- tuple generating dependencies
- special case
- relational databases