Sciweavers

77 search results - page 2 / 16
» Conjunctive Query Answering in SH using Knots
Sort
View
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 6 months ago
Privately Releasing Conjunctions and the Statistical Query Barrier
Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A tr...
Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan U...
PODS
1998
ACM
116views Database» more  PODS 1998»
13 years 10 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 6 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 3 days 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
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 6 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton