Containment and Satisfiability Problem for XPath with Recursion.
Balázs KósaPublished in: ADBIS (2012)
Keyphrases
- satisfiability problem
- transitive closure
- query containment
- sibling axes
- query evaluation
- np complete
- expressive power
- deductive databases
- temporal logic
- search algorithm
- constraint databases
- first order logic
- conjunctive queries
- datalog programs
- spatial databases
- phase transition
- directed acyclic graph
- max sat
- sat problem
- query language
- pspace complete
- decision procedures
- stochastic local search algorithms
- sat instances
- complex objects
- relational algebra
- stochastic local search
- query answering
- xml documents
- conjunctive normal form
- query processing
- labeling scheme
- fixpoint
- data complexity