Sciweavers

606 search results - page 4 / 122
» Memory-constrained aggregate computation over data streams
Sort
View
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
13 years 6 months ago
Maintaining Stream Statistics over Sliding Windows
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...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
14 years 7 months ago
Exponentially Decayed Aggregates on Data Streams
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...
Graham Cormode, Flip Korn, Srikanta Tirthapura
ICDE
2004
IEEE
178views Database» more  ICDE 2004»
14 years 7 months ago
Load Shedding for Aggregation Queries over Data Streams
Brian Babcock, Mayur Datar, Rajeev Motwani
DC
2008
13 years 6 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 6 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...