Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.
Alon Y. LevyInderpal Singh MumickYehoshua SagivOded ShmueliPublished in: PODS (1993)
Keyphrases
- transitive closure
- query evaluation
- guarded fragment
- query containment
- query processing
- expressive power
- response time
- automata theoretic
- query answering
- state space
- deductive databases
- datalog programs
- np complete
- query expansion
- database
- aggregate functions
- decision procedures
- data complexity
- regular path queries
- data sources
- integrity constraints
- conjunctive queries
- information retrieval
- unions of conjunctive queries
- computational complexity
- directed acyclic graph
- propositional logic
- data management
- query rewriting
- data structure
- query language
- semantic web
- query complexity
- logical implication
- keywords
- data warehouse