Efficient Approximations of Conjunctive Queries
SIAM Journal on Computing, Volume 43, Issue 3, 2014, Pages 1085-1130.
EI
Keywords:
Abstract:
When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such approximations for conjunctive queries. These queries are of special importance in databases, ...More
Code:
Data:
Tags
Comments