33 search results - page 1 / 7 » When is the evaluation of conjunctive queries tractable |
STOC
2001
ACM
14 years 5 months ago
2001
ACM
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
ICDE
2009
IEEE
14 years 10 days ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
JAPLL
2010
13 years 4 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
AMW
2011
12 years 9 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...