The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems.
Austen Z. FanParaschos KoutrisHangdong ZhaoPublished in: ICALP (2023)
Keyphrases
- fine grained
- conjunctive queries
- coarse grained
- np complete
- query evaluation
- conjunctive query containment
- query answering
- access control
- query language
- conjunctive regular path queries
- database
- bounded treewidth
- pspace complete
- data complexity
- real valued
- integrity constraints
- decision procedures
- decision problems
- query rewriting
- higher order
- information extraction
- containment of conjunctive queries
- computational complexity
- databases