Computing CQ Lower-Bounds over OWL 2 Through Approximation to RSA.
Federico IgneStefano GermanoIan HorrocksPublished in: ISWC (2021)
Keyphrases
- lower bound
- upper bound
- lagrange interpolation
- np hard
- efficient computation
- conjunctive queries
- approximation algorithms
- query evaluation
- polynomial approximation
- semantic web
- objective function
- min sum
- constant factor
- approximation ratio
- knowledge representation
- linear programming
- upper and lower bounds
- public key
- worst case
- database systems
- randomized algorithm
- approximation guarantees
- error bounds
- branch and bound
- integrality gap