Abstract
We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time elapses. This type of aggregation was first introduced by Cohen and Strauss in [4]. These types of decay functions on streams are used in many applications in which the relative value of streaming data decreases since the time the data was seen. Some recent work and space efficient algorithms were developed for time-decaying aggregations, and in particular polynomial and exponential decaying aggregations. All of the work done so far has maintained multiplicative approximations for the aggregates. In this paper we present the first O(log N) space algorithm for the polynomial decay under a multiplicative approximation, matching a lower bound. In addition, we explore and develop algorithms and lower bounds for approximations allowing an additive error in addition to the multiplicative error. We show that in some cases, allowing an additive error can decrease the amount of space required, while in other cases we cannot do any better than a solution without additive error.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. Of the 2002 ACM Symposium on Principles of Database Systems (PODS 2002). ACM, New York (2002)
Bremler-Barr, A., Cohen, E., Kaplan, H., Mansour, Y.: Predicting and bypassing internet end-to-end service degradations. In: Proc. 2nd ACM-SIGCOMM Internet Measurement Workshop. ACM, New York (2002)
Cohen, E., Kaplan, H., Oldham, J.D.: Managing TCP connections under persistent HTTP. Computer Networks 31, 1709–1723 (1999)
Cohen, E., Strauss, M.: Maintaining time-decaying stream aggregates. In: Proc. Of the 2003 ACM Symposium on Principles of Database Systems (PODS 2003). ACM, New York (2003)
Cohen, E., Strauss, M.: Giga-mining. In: Proc. Of KDD, New York (August 1998)
Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. In: Proc. 13th ACM-SIAM Symp. On Discrete Algorithms. ACM-SIAM (2002)
Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1(4) (1993)
Gibbons, P., Tirthapura, S.: Distributed streams algorithms for sliding windows. In: Proc. Of the 14th Annual ACM Symp. On Parallel Algorithms and Architectures, pp. 63–72. ACM, New York (2002)
Gilchrist, W.: Statistical Forecasting. Wiley, Chichester (1976)
Jacobson, V.: Congestion avoidance and control. In: Proc. Of the ACM-SIGCOMM 1988 conference (August 1988)
Keshav, S., Lund, C., Phillips, S., Reingold, N., Saran, H.: An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks. IEEE J. on Selected Areas in Communication 13 (1995)
Morris, R.: Counting large numbers of events in small registers. CACM 81, 840–842 (1978)
Yao, A.C.: Some complexity questions related to distributed computing. In: Proc. of the 11th ACM STOC, vol. 209, p. 213 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kopelowitz, T., Porat, E. (2005). Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_25
Download citation
DOI: https://doi.org/10.1007/11560586_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)