The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems.
Austen Z. FanParaschos KoutrisHangdong ZhaoPublished in: CoRR (2023)
Keyphrases
- fine grained
- conjunctive queries
- coarse grained
- np complete
- access control
- decision problems
- query answering
- conp complete
- query language
- query evaluation
- boolean expressions
- real valued
- conjunctive query containment
- bounded treewidth
- data exchange
- integrity constraints
- data complexity
- computational complexity
- fixed parameter tractable
- sum product
- boolean functions
- query containment
- data lineage
- high level