Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries.
Gianluigi GrecoFrancesco LupiaFrancesco ScarcelloPublished in: SEBD (2016)
Keyphrases
- conjunctive queries
- np complete
- query answering
- query evaluation
- data complexity
- integrity constraints
- query language
- special case
- query rewriting
- query containment
- probabilistic databases
- boolean expressions
- data exchange
- decision procedures
- greedy algorithm
- dl lite
- constraint satisfaction
- containment of conjunctive queries
- bounded treewidth
- datalog programs
- relational queries
- unions of conjunctive queries
- tuple generating dependencies
- conjunctive query containment
- data sets
- conjunctive regular path queries
- satisfiability problem
- schema mappings
- expressive power
- description logics
- np hard
- relational databases
- search algorithm
- databases