Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width.
Christoph BerkholzNicole SchweikardtPublished in: CoRR (2020)
Keyphrases
- conjunctive queries
- fixed parameter tractable
- preprocessing
- bounded treewidth
- np complete
- query answering
- integrity constraints
- query evaluation
- data complexity
- hypertree width
- query language
- data exchange
- computational problems
- hypertree decomposition
- special case
- probabilistic databases
- np hard
- decision procedures
- query containment
- objective function
- query rewriting
- greedy algorithm
- data sets
- query processing
- search space
- abstract argumentation
- conjunctive regular path queries
- boolean expressions
- regular path queries
- relational queries
- datalog programs
- global constraints
- deductive databases
- incomplete information