Sciweavers

52 search results - page 6 / 11
» On the Decidability of Query Containment under Constraints
Sort
View
PODS
1999
ACM
160views Database» more  PODS 1999»
13 years 11 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
FOCS
2003
IEEE
14 years 20 days ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 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
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 7 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
PODS
2005
ACM
104views Database» more  PODS 2005»
14 years 7 months ago
Determining source contribution in integration systems
Owners of sources registered in an information integration system, which provides answers to a (potentially evolving) set of client queries, need to know their contribution to the...
Alin Deutsch, Yannis Katsis, Yannis Papakonstantin...