When is the evaluation of conjunctive queries tractable?
Martin GroheThomas SchwentickLuc SegoufinPublished in: STOC (2001)
Keyphrases
- conjunctive queries
- np complete
- bounded treewidth
- query answering
- query evaluation
- data complexity
- query language
- integrity constraints
- probabilistic databases
- special case
- data exchange
- query rewriting
- query containment
- np hard
- decision procedures
- boolean expressions
- expressive power
- hypertree decomposition
- database theory
- datalog programs
- computational complexity
- databases
- data sets