Sciweavers

204 search results - page 1 / 41
» Containment of Conjunctive Queries with Negation: Algorithms...
Sort
View
DEXA
2010
Springer
157views Database» more  DEXA 2010»
13 years 4 months ago
Containment of Conjunctive Queries with Negation: Algorithms and Experiments
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
Khalil Ben Mohamed, Michel Leclère, Marie-L...
ICDT
2007
ACM
107views Database» more  ICDT 2007»
13 years 10 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
ADBIS
2009
Springer
148views Database» more  ADBIS 2009»
13 years 11 months ago
On Containment of Conjunctive Queries with Negation
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Victor Felea
ERSHOV
2009
Springer
13 years 11 months ago
On the Containment Problem for Queries in Conjunctive Form with Negation
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
Victor Felea
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 4 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher