Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
Antoine AmarilliMikaël MonetPierre SenellartPublished in: CoRR (2017)
Keyphrases
- conjunctive queries
- combined complexity
- data complexity
- probabilistic databases
- query evaluation
- query answering
- bounded treewidth
- integrity constraints
- np complete
- conjunctive query answering
- query language
- transitive closure
- data exchange
- expressive power
- special case
- regular path queries
- decision procedures
- query rewriting
- relational queries
- query containment
- query complexity
- exptime complete
- transitive roles
- datalog programs
- uncertain data
- lower complexity
- conp complete
- databases
- conjunctive regular path queries
- dl lite
- graph mining
- answering queries
- graph model
- regular expressions
- functional dependencies
- data management
- consistent query answering
- data model
- database systems
- knowledge base