Containment of Monadic Datalog Programs via Bounded Clique-Width.
Mikolaj BojanczykFilip MurlakAdam WitkowskiPublished in: ICALP (2) (2015)
Keyphrases
- datalog programs
- conjunctive queries
- datalog queries
- query answering
- query containment
- deductive databases
- bounded treewidth
- query evaluation
- data complexity
- inconsistent databases
- fixpoint
- magic sets
- np complete
- recursive queries
- integrity constraints
- fixpoint semantics
- query language
- data exchange
- unions of conjunctive queries
- database systems
- decision procedures
- query rewriting
- special case
- computational complexity
- databases