On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases.
Jef WijsenPublished in: PODS (2010)
Keyphrases
- conjunctive queries
- uncertain databases
- unions of conjunctive queries
- queries using views
- query answering
- integrity constraints
- query evaluation
- data complexity
- uncertain data
- np complete
- query language
- probabilistic databases
- data exchange
- primary key
- special case
- query containment
- datalog programs
- query rewriting
- first order logic
- formal semantics
- decision procedures
- relational queries
- containment of conjunctive queries
- dl lite
- data mining
- frequent itemset mining
- transitive closure
- query processing
- answering queries
- database
- computational complexity
- natural language
- functional dependencies
- expressive power