Time-decaying aggregates in out-of-order streams
Open Access
- 9 June 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 89-98
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Finding (Recently) Frequent Items in Distributed Data Streams2005
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive ErrorLecture Notes in Computer Science, 2005
- Approximate counts and quantiles over sliding windows2004
- Distributed Streams Algorithms for Sliding WindowsTheory of Computing Systems, 2004
- Adaptive Spatial Partitioning for Multidimensional Data Streams2004
- Exploiting punctuation semantics in continuous data streamsIEEE Transactions on Knowledge and Data Engineering, 2003
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- Finding repeated elementsScience of Computer Programming, 1982
- Selection and sorting with limited storageTheoretical Computer Science, 1980