Maintaining time-decaying stream aggregates

Authors:
Edith Cohen;Martin Strauss
Affiliations:
AT&T Research Labs, Florham Park, NJ;AT&T Research Labs, Florham Park, NJ
Venue:
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2003

Citing 9
Cited 33

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Managing TCP connection under persistent HTTP

WWW '99 Proceedings of the eighth international conference on World Wide Web
Counting large numbers of events in small registers

Communications of the ACM
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maintaining stream statistics over sliding windows: (extended abstract)

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed streams algorithms for sliding windows

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Predicting and bypassing end-to-end internet service degradations

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks

IEEE Journal on Selected Areas in Communications

Online Amnesic Approximation of Streaming Time Series

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient estimation algorithms for neighborhood variance and other moments

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Spatially-decaying aggregation over a network: model and algorithms

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Finding (Recently) Frequent Items in Distributed Data Streams

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Maintaining time-decaying stream aggregates

Journal of Algorithms
Approximately detecting duplicates for streaming data using stable bloom filters

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Modeling skew in data streams

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
InteMon: continuous mining of sensor data in large-scale self-infrastructures

ACM SIGOPS Operating Systems Review
On biased reservoir sampling in the presence of stream evolution

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
InteMon: intelligent system monitoring on large clusters

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Maintaining stream statistics over multiscale sliding windows

ACM Transactions on Database Systems (TODS)
Spatially-decaying aggregation over a network

Journal of Computer and System Sciences
Time-decaying sketches for sensor data aggregation

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Summarizing data using bottom-k sketches

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
WIC: a general-purpose algorithm for monitoring web information sources

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Time-decaying aggregates in out-of-order streams

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tighter estimation using bottom k sketches

Proceedings of the VLDB Endowment
Improved approximate detection of duplicates for data streams over sliding windows

Journal of Computer Science and Technology
Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Maintaining time-decaying stream aggregates

Journal of Algorithms
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams

Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
A fast approximation strategy for summarizing a set of streaming time series

Proceedings of the 2010 ACM Symposium on Applied Computing
Online amnesic summarization of streaming locations

SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
A test paradigm for detecting changes in transactional data streams

DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
A comparison between approximate counting and sampling methods for frequent pattern mining on data streams

Intelligent Data Analysis
Discovery of frequent patterns in transactional data streams

Transactions on large-scale data- and knowledge-centered systems II
Discovery of frequent patterns in transactional data streams

Transactions on large-scale data- and knowledge-centered systems II
Improved algorithms for polynomial-time decay and time-decay with additive error

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Time-decaying bloom filters for efficient middle-tier data management

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
A recent-biased dimension reduction technique for time series data

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Querying sliding windows over online data streams

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Private decayed predicate sums on streams

Proceedings of the 16th International Conference on Database Theory
Clustering spatial data streams for targeted alerting in disaster response

Proceedings of the 4th ACM SIGSPATIAL International Workshop on GeoStreaming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a factor that depends on, and is non-decreasing with, elapsed time. Time-decaying aggregates are used in applications where the significance of data items decreases over time. We develop storage-efficient algorithms, and establish upper and lower bounds. Surprisingly, even though maintaining decayed aggregates have become a widely-used tool, our work seems to be the first both to explore it formally and to provide storage-efficient algorithms for important families of decay functions, including polynomial decay.