The Complexity of Boolean Conjunctive Queries with Intersection Joins.
Mahmoud Abo KhamisGeorge ChichirimAntonia KormpaDan OlteanuPublished in: CoRR (2021)
Keyphrases
- conjunctive queries
- query evaluation
- join queries
- conjunctive query containment
- query answering
- data complexity
- conp complete
- np complete
- boolean expressions
- integrity constraints
- conjunctive regular path queries
- query language
- bounded treewidth
- data exchange
- lower complexity
- probabilistic databases
- fixed parameter tractable
- special case
- query rewriting
- pspace complete
- computational complexity
- decision procedures
- query containment
- data management
- datalog programs
- expressive power
- containment of conjunctive queries
- boolean functions
- query optimization
- xml data
- databases
- query complexity
- range queries
- description logics
- data mining