274 search results - page 1 / 55 » On Random Sampling over Joins |
SSDBM
2007
IEEE
13 years 11 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
SIGMOD
1999
ACM
13 years 9 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
SSDBM
2008
IEEE
13 years 11 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...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...