Sciweavers

219 search results - page 3 / 44
» Approximating a Data Stream for Querying and Estimation: Alg...
Sort
View
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 5 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
PVLDB
2008
116views more  PVLDB 2008»
13 years 5 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
GIS
2007
ACM
14 years 6 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 8 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
CIKM
2006
Springer
13 years 9 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...