Keywords
- Decay Function
- Polynomial Decay
- Decay Threshold
- High-dimensional Euclidean Space
- Random Early Detection (RED)
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Recommended Reading
Babcock B., Babu S., Datar M., Motwani R., Widom J. Models and issues in data stream systems. In: Proceeding of 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: Proceeding of 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:441–53.
Cohen E. and Kaplan H. Efficient estimation algorithms for neighborhood variance and other moments. In: Proceeding of 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:265–88.
Cohen E. and Kaplan H. Summarizing data using bottom-k sketches. In: Proceeding of 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:1709–23.
Cohen E. and Strauss M. Maintaining time-decaying stream aggregates. In: Proceeding of 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:19–36.
Cormode G., Tirthapura S., and Xu B. Time-decaying sketches for sensor data aggregation. In: Proceeding of 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: Proceeding of 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 Proceeding of 14th Annual ACM Symposium on Parallel Algorithms and Architectures; p. 63–72 2002.
Guibas LJ, Knuth DE, Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica. 1992;7: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: Proceeding of 33rd International Conference on Very Large Data Bases; 2007.
Jacobson V. Congestion avoidance and control. In: Proceeding of 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
© 2016 Springer Science+Business Media LLC
About this entry
Cite this entry
Cohen, E. (2016). Decay Models. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_126-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_126-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering