On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems.
Sha GuoWei SunMark Allen WeissPublished in: IEEE Trans. Knowl. Data Eng. (1996)
Keyphrases
- problems involving
- conjunctive queries
- database systems
- query containment
- np complete
- decision procedures
- guarded fragment
- datalog programs
- satisfiability problem
- query answering
- query evaluation
- integrity constraints
- query optimization
- query processing
- data complexity
- query language
- optimization problems
- data exchange
- computational complexity
- data management
- special case
- data model
- query rewriting
- probabilistic databases
- relational database systems
- regular path queries
- database
- database design
- tight complexity bounds
- databases
- database management systems
- containment of conjunctive queries
- constraint satisfaction problems
- bounded treewidth
- multiple objectives
- propositional logic
- modal logic
- transitive closure
- np hard
- theorem proving
- deductive databases
- answering queries
- cnf formula
- automated reasoning
- relational queries
- satisfiability testing
- evolutionary algorithm
- query execution