1091 search results - page 147 / 219 » Approximation in Databases |
144
Voted
PODS
2001
ACM
16 years 2 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
111
click to vote
PODS
2003
ACM
16 years 2 months ago
2003
ACM
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
130
Voted
PODS
2004
ACM
16 years 2 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
120
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
121
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...