Sciweavers

17 search results - page 2 / 4
» On the decidability and complexity of query answering over i...
Sort
View
JAPLL
2010
179views more  JAPLL 2010»
13 years 3 months ago
Tractable query answering and rewriting under description logic constraints
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 ...
Héctor Pérez-Urbina, Boris Motik, Ia...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 5 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
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 2 days ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
PODS
1995
ACM
139views Database» more  PODS 1995»
13 years 8 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
DBPL
2005
Springer
143views Database» more  DBPL 2005»
13 years 10 months ago
Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
Diego Calvanese, Giuseppe De Giacomo, Domenico Lem...