Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Decay Models

  • Edith CohenEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_126


Decay models are applicable on data sets where data items are associated with points in a metric space (locations) and there is a notion of “significance” of a data item to a location, which decays (decreases) with the distance between the item and the location. This decrease is modeled by a decay function.

Each location has a “view” of the data set through a different weight distribution over the items: the weight associated with each item is its decayed weight which is a product of its original weight and a decay function applied to its distance from the observing location.

While global aggregates or statistics are computed over the set of items and their original weights, decaying aggregates or decaying statistics depend on the location with respect to which the aggregation is performed and on the decay function. Figure 1 illustrates a small network and the decaying sum with respect to all nodes.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Cohen E. Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci. 1997;55(3):441–53.CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Cohen E, Kaplan H. Spatially-decaying aggregation over a network: model and algorithms. J Comput Syst Sci. 2007;73(3):265–88.CrossRefzbMATHGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    Cohen E, Kaplan H, Oldham JD. Managing TCP connections under persistent HTTP. Comput Netw. 1999;31(11–16):1709–23.CrossRefGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Cohen E, Strauss M. Maintaining time-decaying stream aggregates. J Algorithms. 2006;59(1):19–36.CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    Crespo A. and Garcia-Molina H. Routing indices for peer-to-peer systems. In: Proceedings of the 18th International Conference on Data Engineering; 2002.Google Scholar
  12. 12.
    Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows. SIAM J Comput. 2002;31(6):1794–813.CrossRefMathSciNetzbMATHGoogle Scholar
  13. 13.
    Floyd S. and Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking, 1(4), 1993.CrossRefGoogle Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    Guibas LJ, Knuth DE, Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica. 1992;7(1–6):381–413.CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    Jacobson V. Congestion avoidance and control. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1988.Google Scholar
  18. 18.
    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.CrossRefGoogle Scholar
  19. 19.
    Scott DW. Multivariate density estimation: Theory, practice and visualization. New York: Wiley; 1992.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.AT&T Labs-ResearchFlorham ParkUSA

Section editors and affiliations

  • Divesh Srivastava
    • 1
  1. 1.AT&T Labs - ResearchAT&TBedminsterUSA