The complexity of reverse engineering problems for conjunctive queries.
Pablo BarcelóMiguel RomeroPublished in: CoRR (2016)
Keyphrases
- conjunctive queries
- engineering problems
- conjunctive query containment
- query answering
- query evaluation
- integrity constraints
- data complexity
- conp complete
- np complete
- query language
- bounded treewidth
- data exchange
- engineering design
- conjunctive regular path queries
- query rewriting
- lower complexity
- special case
- query containment
- biological systems
- computational complexity
- probabilistic databases
- datalog programs
- data integration
- decision procedures
- database
- databases
- case study
- multiobjective optimization
- query processing
- decision problems
- search algorithm
- np hard
- relational queries
- data management
- genetic algorithm
- regular path queries
- machine learning
- fixed parameter tractable
- xml data