The Complexity of Boolean Conjunctive Queries with Intersection Joins.
Mahmoud Abo KhamisGeorge ChichirimAntonia KormpaDan OlteanuPublished in: PODS (2022)
Keyphrases
- conjunctive queries
- query evaluation
- join queries
- conjunctive query containment
- query answering
- boolean expressions
- integrity constraints
- conjunctive regular path queries
- data complexity
- conp complete
- query language
- bounded treewidth
- np complete
- probabilistic databases
- data exchange
- decision procedures
- lower complexity
- query containment
- query rewriting
- query processing
- computational complexity
- real valued
- special case
- transitive closure
- decision problems
- expressive power
- query optimization
- data mining
- boolean functions
- pspace complete
- foreign key
- regular path queries
- fixed parameter tractable
- containment of conjunctive queries
- queries using views