725 search results - page 32 / 145 » Approximate Join Processing Over Data Streams |
124
click to vote
SSDBM
2008
IEEE
15 years 8 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
141
click to vote
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
104
click to vote
PVLDB
2010
15 years 10 days ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
253
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
190
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...