A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries.
Bas KetsmanDan SuciuPublished in: PODS (2017)
Keyphrases
- worst case
- parallel computation
- dynamic programming
- optimal solution
- conjunctive queries
- np hard
- objective function
- parallel implementation
- lower bound
- parallel algorithm
- real time
- query answering
- database
- parallel computing
- np complete
- description logics
- general purpose
- probabilistic model
- special case
- computational complexity