Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width.
Christoph BerkholzNicole SchweikardtPublished in: MFCS (2019)
Keyphrases
- conjunctive queries
- fixed parameter tractable
- preprocessing
- bounded treewidth
- query answering
- integrity constraints
- np complete
- query evaluation
- hypertree width
- query language
- data complexity
- data exchange
- query containment
- query rewriting
- special case
- greedy algorithm
- np hard
- computational problems
- search space
- decision procedures
- probabilistic databases
- queries using views
- datalog programs
- data mining
- global constraints
- autonomous agents
- data management
- boolean expressions
- containment of conjunctive queries
- incomplete information
- functional dependencies
- relational queries
- regular path queries
- unions of conjunctive queries
- data analysis
- objective function