142 search results - page 5 / 29 » On Conjunctive Query Answering in EL |
ICDT
2009
ACM
14 years 9 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...
JSC
2010
13 years 7 months ago
2010
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
EDBT
2004
ACM
14 years 8 months ago
2004
ACM
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...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
ICDE
1996
IEEE
14 years 10 months ago
1996
IEEE
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previou...