Sciweavers

49 search results - page 1 / 10
» Optimal sampling from sliding windows
Sort
View
PODS
2009
ACM
112views Database» more  PODS 2009»
14 years 11 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 11 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 4 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 11 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
JACM
2012
12 years 1 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang