Sciweavers

297 search results - page 11 / 60
» On the Decidability of Consistent Query Answering
Sort
View
ICDT
2001
ACM
86views Database» more  ICDT 2001»
14 years 26 days ago
Minimizing View Sets without Losing Query-Answering Power
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, w...
Chen Li, Mayank Bawa, Jeffrey D. Ullman
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 9 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
SEMWEB
2004
Springer
14 years 1 months ago
An Initial Investigation into Querying an Untrustworthy and Inconsistent Web
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
Yuanbo Guo, Jeff Heflin
GIS
2008
ACM
14 years 9 months ago
An inconsistency tolerant approach to querying spatial databases
In order to deal with inconsistent databases, a repair semantics defines a set of admissible database instances that restore consistency, while staying close to the original insta...
Leopoldo E. Bertossi, Mónica Caniupá...
CL
2000
Springer
14 years 23 days ago
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
Marcelo Arenas, Leopoldo E. Bertossi, Michael Kife...