Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas.
Cristian RiverosBenjamin ScheidtNicole SchweikardtPublished in: CoRR (2024)
Keyphrases
- acyclic conjunctive queries
- conjunctive queries
- np complete
- relational database theory
- bounded treewidth
- boolean formulae
- np hard
- query evaluation
- data complexity
- schema mappings
- query answering
- dl lite
- answering queries
- query language
- integrity constraints
- data exchange
- databases
- query types
- computational complexity
- search space
- special case
- data integration
- continuous queries
- query rewriting
- datalog programs
- satisfiability problem
- data model
- expressive power
- functional dependencies
- database schema
- deductive databases
- description logics