151 search results - page 11 / 31 » Answering approximate queries over autonomous web databases |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
VLDB
2004
ACM
14 years 29 days ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Integrating Deep Web sources requires highly accurate semantic matches between the attributes of the source query interfaces. These matches are usually established by comparing th...
EDBT
2004
ACM
14 years 7 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...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...