43 search results - page 6 / 9 » Lower Bounds for Multi-Pass Processing of Multiple Data Stre... |
SIAMCOMP
2002
14 years 9 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
159
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
DMKD
2003
ACM
15 years 2 months ago
2003
ACM
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
103
Voted
IOPADS
1997
14 years 10 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
PODS
2005
ACM
15 years 9 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...