Addendum to "On Satisfiability, Equivalence, and Implication Problems Involving Conjunctive Queries in Database Systems".
Sha GuoWei SunMark Allen WeissPublished in: IEEE Trans. Knowl. Data Eng. (1998)
Keyphrases
- problems involving
- conjunctive queries
- database systems
- query containment
- np complete
- decision procedures
- datalog programs
- guarded fragment
- query evaluation
- query answering
- query language
- satisfiability problem
- query optimization
- integrity constraints
- data complexity
- data model
- tight complexity bounds
- data management
- special case
- functional dependencies
- query processing
- query rewriting
- regular path queries
- computational complexity
- probabilistic databases
- database design
- containment of conjunctive queries
- databases
- optimization problems
- data exchange
- database management systems
- unions of conjunctive queries
- relational database systems
- boolean expressions
- database
- np hard
- transitive closure
- cnf formula
- multiple objectives
- automated reasoning
- query execution
- inference rules
- phase transition
- modal logic
- normal form
- constraint satisfaction problems
- data integration