Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
Antoine AmarilliMikaël MonetPierre SenellartPublished in: PODS (2017)
Keyphrases
- conjunctive queries
- combined complexity
- data complexity
- probabilistic databases
- query evaluation
- query answering
- integrity constraints
- np complete
- bounded treewidth
- conjunctive query answering
- query language
- data exchange
- expressive power
- transitive closure
- special case
- exptime complete
- decision procedures
- query rewriting
- conjunctive regular path queries
- graph databases
- relational queries
- dl lite
- directed graph
- database
- query complexity
- regular path queries
- datalog programs
- graph model
- uncertain data
- satisfiability problem
- double exponential
- query processing
- tuple generating dependencies
- description logics
- np hard
- transitive roles
- databases
- conp complete
- inclusion dependencies
- model checking
- lower complexity
- schema mappings
- graph mining