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
Recommended Reading
Babcock B., Babu S., \enlargethispage*{8pt} Datar M., Motwani R., Widom J. Models and issues in data stream systems. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2002.
Bremler-Barr A., Cohen E., Kaplan H., and Mansour Y. Predicting and bypassing internet end-to-end service degradations. In: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement; 2002.
Cohen E. Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci. 1997;55(3):441–53.
Cohen E. and Kaplan H. Efficient estimation algorithms for neighborhood variance and other moments. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms; 2004.
Cohen E, Kaplan H. Spatially-decaying aggregation over a network: model and algorithms. J Comput Syst Sci. 2007;73(3):265–88.
Cohen E. and Kaplan H. Summarizing data using bottom-k sketches. In: Proceedings of the ACM SIGACT-SIGOPS 26th Symposium on the Principles of Distributed Computing; 2007.
Cohen E, Kaplan H, Oldham JD. Managing TCP connections under persistent HTTP. Comput Netw. 1999;31(11–16):1709–23.
Cohen E. and Strauss M. Maintaining time-decaying stream aggregates. In: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2003.
Cohen E, Strauss M. Maintaining time-decaying stream aggregates. J Algorithms. 2006;59(1):19–36.
Cormode G., Tirthapura S., and Xu B. Time-decaying sketches for sensor data aggregation. In: Proceedings of the ACM SIGACT-SIGOPS 26th Symposium on the Principles of Distributed Computing; 2007.
Crespo A. and Garcia-Molina H. Routing indices for peer-to-peer systems. In: Proceedings of the 18th International Conference on Data Engineering; 2002.
Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows. SIAM J Comput. 2002;31(6):1794–813.
Floyd S. and Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking, 1(4), 1993.
Gibbons P.B. and Tirthapura S. Distributed streams algorithms for sliding windows. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures; 2002. p. 63–72.
Guibas LJ, Knuth DE, Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica. 1992;7(1–6):381–413.
Hua M., Pei J., Fu A.W.C., Lin X., and Leung H.-F. Efficiently answering top-k typicality queries on large databases. In: Proceedings of the 33rd International Conference on Very Large Data Bases; 2007.
Jacobson V. Congestion avoidance and control. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 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. J Select Areas Commun. 1995;13(8):1371–82.
Scott DW. Multivariate density estimation: Theory, practice and visualization. New York: Wiley; 1992.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Cohen, E. (2018). Decay Models. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_126
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_126
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering