A More General Theory of Static Approximations for Conjunctive Queries

ICDT, pp. 7:1-7:22, 2018.

Cited by: 0|Bibtex|Views34|Links
EI

Abstract:

Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. If a CQ is hard to evaluate, it is thus useful to evaluate an approximation of it in such fragments. While underapproximations (i.e., those that return correct answers only) are well-understood, the dual notion of overapproxima...More

Code:

Data:

Your rating :
0

 

Tags
Comments